/
parser.h
162 lines (120 loc) · 4.64 KB
/
parser.h
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
/*
* The Doomsday Engine Project -- libdeng2
*
* Copyright (c) 2004-2013 Jaakko Keränen <jaakko.keranen@iki.fi>
*
* This program is free software; you can redistribute it and/or modify
* it under the terms of the GNU General Public License as published by
* the Free Software Foundation; either version 2 of the License, or
* (at your option) any later version.
*
* This program is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
* GNU General Public License for more details.
*
* You should have received a copy of the GNU General Public License
* along with this program; if not, see <http://www.gnu.org/licenses/>.
*/
#ifndef LIBDENG2_PARSER_H
#define LIBDENG2_PARSER_H
#include "../libdeng2.h"
#include "../IParser"
#include "../TokenBuffer"
#include "../TokenRange"
#include "../ScriptLex"
#include "../Operator"
#include "../Expression"
#include <QFlags>
namespace de {
class Compound;
class ExpressionStatement;
class PrintStatement;
class IfStatement;
class WhileStatement;
class ForStatement;
class AssignStatement;
class DeleteStatement;
class FunctionStatement;
class ArrayExpression;
class DictionaryExpression;
class OperatorExpression;
class NameExpression;
/**
* Reads Doomsday script source in text format and outputs the statements
* of the script into a Script object.
*
* @ingroup script
*/
class Parser : public IParser
{
public:
/// A syntax error is detected during the parsing. Note that the Lex classes
/// also define syntax errors. @ingroup errors
DENG2_ERROR(SyntaxError);
/// A token is encountered where we don't know what to do with it. @ingroup errors
DENG2_SUB_ERROR(SyntaxError, UnexpectedTokenError);
/// A token is expected, but nothing was found. @ingroup errors
DENG2_SUB_ERROR(SyntaxError, MissingTokenError);
/// A colon is expected but not found. @ingroup errors
DENG2_SUB_ERROR(SyntaxError, MissingColonError);
// Flags for parsing conditional compounds.
enum CompoundFlag
{
HasCondition = 0x1,
StayAtClosingStatement = 0x2,
IgnoreExtraBeforeColon = 0x4
};
Q_DECLARE_FLAGS(CompoundFlags, CompoundFlag)
public:
Parser();
~Parser();
// Implements IParser.
void parse(String const &input, Script &output);
void parseCompound(Compound &compound);
void parseStatement(Compound &compound);
Expression *parseConditionalCompound(Compound &compound, CompoundFlags const &flags = 0);
IfStatement *parseIfStatement();
WhileStatement *parseWhileStatement();
ForStatement *parseForStatement();
ExpressionStatement *parseImportStatement();
ExpressionStatement *parseExportStatement();
ExpressionStatement *parseDeclarationStatement();
DeleteStatement *parseDeleteStatement();
FunctionStatement *parseFunctionStatement();
void parseTryCatchSequence(Compound &compound);
PrintStatement *parsePrintStatement();
AssignStatement *parseAssignStatement();
ExpressionStatement *parseExpressionStatement();
/// Parse a range of tokens as a comma-separated argument list:
ArrayExpression *parseList(TokenRange const &range,
QChar const *separator = Token::COMMA,
Expression::Flags const &flags = Expression::ByValue);
/// Parse a range of tokens as an operator-based expression.
Expression *parseExpression(TokenRange const &range,
Expression::Flags const &flags = Expression::ByValue);
ArrayExpression *parseArrayExpression(TokenRange const &range);
DictionaryExpression *parseDictionaryExpression(TokenRange const &range);
Expression *parseCallExpression(TokenRange const &nameRange,
TokenRange const &argumentRange);
OperatorExpression *parseOperatorExpression(Operator op,
TokenRange const &leftSide, TokenRange const &rightSide,
Expression::Flags const &rightFlags = Expression::ByValue);
Expression *parseTokenExpression(TokenRange const &range,
Expression::Flags const &flags = Expression::ByValue);
Operator findLowestOperator(TokenRange const &range,
TokenRange &leftSide, TokenRange &rightSide);
protected:
/// Gets the set of tokens for the next statement.
/// @return Number of tokens found.
duint nextStatement();
private:
ScriptLex _analyzer;
TokenBuffer _tokens;
// Range of the current statement. Can be a subrange of the full
// set of tokens.
TokenRange _statementRange;
};
Q_DECLARE_OPERATORS_FOR_FLAGS(de::Parser::CompoundFlags)
} // namespace de
#endif /* LIBDENG2_PARSER_H */