-
Notifications
You must be signed in to change notification settings - Fork 10
/
LaParser.h
98 lines (92 loc) · 2.72 KB
/
LaParser.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
#ifndef LAPARSER_H
#define LAPARSER_H
/*
* Copyright 2019 Rochus Keller <mailto:[email protected]>
*
* This file is part of the EbnfStudio application.
*
* The following is the license that applies to this copy of the
* application. For a license to use the application under conditions
* other than those described here, please email to [email protected].
*
* GNU General Public License Usage
* This file may be used under the terms of the GNU General Public
* License (GPL) versions 2.0 or 3.0 as published by the Free Software
* Foundation and appearing in the file LICENSE.GPL included in
* the packaging of this file. Please review the following information
* to ensure GNU General Public Licensing requirements will be met:
* http://www.fsf.org/licensing/licenses/info/GPLv2.html and
* http://www.gnu.org/copyleft/gpl.html.
*/
#include <QString>
#include <QSharedData>
class LaLexer
{
public:
struct Tok
{
enum { Invalid, Literal, Ident, Or, And, Not, LPar, RPar, Colon, Index, Eof };
static const char* s_typeNames[];
quint8 d_type;
QByteArray d_val;
Tok(quint8 t = Invalid, const QByteArray& v = QByteArray() ):d_type(t),d_val(v){}
bool isValid() const { return d_type != Invalid && d_type != Eof; }
};
LaLexer();
void setStr( const QByteArray& );
Tok nextToken();
Tok peekToken(quint8 lookAhead = 1);
protected:
Tok nextTokenImp();
void skipWhiteSpace();
Tok ident();
Tok literal();
Tok index();
Tok token( quint8 type, int len = 1, const QByteArray& v = QByteArray() );
private:
QByteArray d_str;
QList<Tok> d_buffer;
int d_pos;
};
/* Syntax
*
* la_expr ::= la_term { '|' la_term }
* la_term ::= la_factor { '&' la_factor }
* la_factor ::= Index ':' factor | '(' la_expr ')'
* expression ::= term { '|' term }
* term ::= factor { '&' factor }
* factor ::= String | Literal | '!' factor | '(' expression ')'
*
* */
class LaParser
{
public:
struct Ast;
typedef QExplicitlySharedDataPointer<Ast> AstRef;
struct Ast : public QSharedData
{
enum { Invalid, And, Or, Not, Ident, Literal, La };
static const char* s_typeNames[];
quint8 d_type;
QByteArray d_val;
QList<AstRef> d_subs;
Ast( quint8 t = Invalid, const QByteArray& v = QByteArray() ):d_type(t),d_val(v) {}
void dump(int level = 0);
};
LaParser();
bool parse(const QByteArray&);
AstRef getLaExpr() const { return d_res; }
const QString& getErr() const { return d_err; }
protected:
AstRef expression();
AstRef laExpr();
AstRef term();
AstRef laTerm();
AstRef factor();
AstRef laFactor();
private:
LaLexer d_lex;
QString d_err;
AstRef d_res;
};
#endif // LAPARSER_H