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
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
|
/****************************************************************************
**
** Copyright (C) 2009 Nokia Corporation and/or its subsidiary(-ies).
** Contact: Nokia Corporation (qt-info@nokia.com)
**
** This file is part of the test suite module of the Qt Toolkit.
**
** $QT_BEGIN_LICENSE:LGPL$
** No Commercial Usage
** This file contains pre-release code and may not be distributed.
** You may use this file in accordance with the terms and conditions
** contained in the either Technology Preview License Agreement or the
** Beta Release License Agreement.
**
** GNU Lesser General Public License Usage
** Alternatively, this file may be used under the terms of the GNU Lesser
** General Public License version 2.1 as published by the Free Software
** Foundation and appearing in the file LICENSE.LGPL included in the
** packaging of this file. Please review the following information to
** ensure the GNU Lesser General Public License version 2.1 requirements
** will be met: http://www.gnu.org/licenses/old-licenses/lgpl-2.1.html.
**
** In addition, as a special exception, Nokia gives you certain
** additional rights. These rights are described in the Nokia Qt LGPL
** Exception version 1.0, included in the file LGPL_EXCEPTION.txt in this
** package.
**
** GNU General Public License Usage
** Alternatively, this file may be used under the terms of the GNU
** General Public License version 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 the GNU General Public License version 3.0 requirements will be
** met: http://www.gnu.org/copyleft/gpl.html.
**
** If you are unsure which license is appropriate for your use, please
** contact the sales department at http://qt.nokia.com/contact.
** $QT_END_LICENSE$
**
****************************************************************************/
#include "lambda.h"
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include "parser_table_p.h"
class Parser: protected parser_table
{
public:
union Value {
int ival;
// ### more...
};
public:
Parser();
~Parser();
bool parse();
protected:
inline void reallocateStack();
inline Value &sym(int index)
{ return sym_stack [tos + index - 1]; }
int nextToken();
void consumeRule(int ruleno);
protected:
int tos;
int stack_size;
Value *sym_stack;
int *state_stack;
int current_char;
unsigned in_tag: 1;
};
inline void Parser::reallocateStack()
{
if (! stack_size)
stack_size = 128;
else
stack_size <<= 1;
sym_stack = reinterpret_cast<Value*> (::realloc(sym_stack, stack_size * sizeof(Value)));
state_stack = reinterpret_cast<int*> (::realloc(state_stack, stack_size * sizeof(int)));
}
Parser::Parser():
tos(0),
stack_size(0),
sym_stack(0),
state_stack(0)
{
}
Parser::~Parser()
{
if (stack_size) {
::free(sym_stack);
::free(state_stack);
}
}
bool Parser::parse()
{
const int INITIAL_STATE = 0;
current_char = 0;
in_tag = 0;
int yytoken = -1;
reallocateStack();
tos = 0;
state_stack[++tos] = INITIAL_STATE;
while (true)
{
if (yytoken == -1 && - TERMINAL_COUNT != action_index [state_stack [tos]])
yytoken = nextToken();
int act = t_action (state_stack [tos], yytoken);
if (act == ACCEPT_STATE) {
return true;
}
else if (act > 0)
{
if (++tos == stack_size)
reallocateStack();
sym_stack [tos].ival = current_char; // ### save the token value here
state_stack [tos] = act;
yytoken = -1;
}
else if (act < 0)
{
int r = - act - 1;
tos -= rhs [r];
act = state_stack [tos++];
consumeRule (r);
state_stack [tos] = nt_action (act, lhs [r] - TERMINAL_COUNT);
}
else
break;
}
return false;
}
int Parser::nextToken()
{
static int tokens[] = { ID, ID, ID, EOF_SYMBOL };
static int *tk = tokens;
return *tk++;
}
void Parser::consumeRule(int ruleno)
{
switch (ruleno) {
case Symbol:
printf("symbol\n");
break;
case SubExpression:
printf("sub-expr\n");
break;
case Appl:
printf("appl\n");
break;
case Abstr:
printf("abstr\n");
break;
}
}
/////////////////////////////
// entry point
/////////////////////////////
int main()
{
Parser parser;
if (parser.parse())
printf ("OK\n");
else
printf ("KO\n");
}
|
