/**************************************************************************** ** ** Copyright (C) 2016 The Qt Company Ltd. ** Contact: https://www.qt.io/licensing/ ** ** This file is part of the QLALR module of the Qt Toolkit. ** ** $QT_BEGIN_LICENSE:GPL-EXCEPT$ ** Commercial License Usage ** Licensees holding valid commercial Qt licenses may use this file in ** accordance with the commercial license agreement provided with the ** Software or, alternatively, in accordance with the terms contained in ** a written agreement between you and The Qt Company. For licensing terms ** and conditions see https://www.qt.io/terms-conditions. For further ** information use the contact form at https://www.qt.io/contact-us. ** ** GNU General Public License Usage ** Alternatively, this file may be used under the terms of the GNU ** General Public License version 3 as published by the Free Software ** Foundation with exceptions as appearing in the file LICENSE.GPL3-EXCEPT ** included in the packaging of this file. Please review the following ** information to ensure the GNU General Public License requirements will ** be met: https://www.gnu.org/licenses/gpl-3.0.html. ** ** $QT_END_LICENSE$ ** ****************************************************************************/ #ifndef QPARSER_H #define QPARSER_H #include #include template class QParser: protected _Table { public: QParser(); ~QParser(); bool parse(); inline _Value &sym(int index); private: inline int nextToken() { return static_cast<_Parser*> (this)->nextToken(); } inline void consumeRule(int rule) { static_cast<_Parser*> (this)->consumeRule(rule); } enum { DefaultStackSize = 128 }; struct Data: public QSharedData { Data(): stackSize (DefaultStackSize), tos (0) {} QVarLengthArray stateStack; QVarLengthArray<_Value, DefaultStackSize> parseStack; int stackSize; int tos; void reallocateStack() { stackSize <<= 1; stateStack.resize(stackSize); parseStack.resize(stackSize); } }; QSharedDataPointer d; }; template inline _Value &QParser<_Parser, _Table, _Value>::sym(int n) { return d->parseStack [d->tos + n - 1]; } template QParser<_Parser, _Table, _Value>::QParser(): d(new Data()) { } template QParser<_Parser, _Table, _Value>::~QParser() { } template bool QParser<_Parser, _Table, _Value>::parse() { const int INITIAL_STATE = 0; d->tos = 0; d->reallocateStack(); int act = d->stateStack[++d->tos] = INITIAL_STATE; int token = -1; forever { if (token == -1 && - _Table::TERMINAL_COUNT != _Table::action_index[act]) token = nextToken(); act = _Table::t_action(act, token); if (d->stateStack[d->tos] == _Table::ACCEPT_STATE) return true; else if (act > 0) { if (++d->tos == d->stackSize) d->reallocateStack(); d->parseStack[d->tos] = d->parseStack[d->tos - 1]; d->stateStack[d->tos] = act; token = -1; } else if (act < 0) { int r = - act - 1; d->tos -= _Table::rhs[r]; act = d->stateStack[d->tos++]; consumeRule(r); act = d->stateStack[d->tos] = _Table::nt_action(act, _Table::lhs[r] - _Table::TERMINAL_COUNT); } else break; } return false; } #endif // QPARSER_H