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
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
|
%{
/***************************************************************************
* Copyright (C) 2005 by Alexander Dymo *
* adymo@kdevelop.org *
* Copyright (C) 2006 by Andreas Pakulat *
* apaku@gmx.de *
* *
* This program is free software; you can redistribute it and/or modify *
* it under the terms of the GNU Library 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 Library General Public *
* License along with this program; if not, write to the *
* Free Software Foundation, Inc., *
* 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA. *
***************************************************************************/
/**
@file qmake.yy
QMake Parser
Simple LALR parser which builds the syntax tree (see @ref QMake::AST).
@todo Recognize comments after statements like:
SOURCES = foo #regognize me
@fixme Parser fails on files that do not end with a newline
@fixme 1 shift/reduce conflict in "line_body" rule
*/
#include <qvaluestack.h>
#include "qmakeast.h"
#include <qregexp.h>
#define YYSTYPE_IS_DECLARED
namespace QMake
{
class Lexer;
/**
The yylval type.
*/
struct Result {
Result(): node(0) {}
/**Type of semantic value for simple grammar rules.*/
QString value;
/**Type of semantic value for grammar rules which are parts of AST.*/
AST *node;
/**Type of semantic value for "multiline_values" grammar rule.
Each line of multiline value is stored as a string in the list.
For example we have in .pro file:
@code
SOURCE = foo1.cpp \
foo2.cpp \
foo3.cpp foo4.cpp
@endcode
The string list will be populated with three strings:
<pre>
foo1.cpp
foo2.cpp
foo3.cpp foo4.cpp
</pre>
*/
QStringList values;
QString indent;
};
#define YYSTYPE Result
typedef Result YYSTYPE;
}
extern int QMakelex( QMake::Result* yylval, QMake::Lexer* lexer );
/**
The stack to store ProjectAST pointers when a new child
ProjectAST is created and filled with statements.
Parser creates root ProjectAST for a .pro file, pushes it onto the stack and starts
adding statements. Each statement is added as a child StatementAST to the ProjectAST
currently on the top in the stack.
When a scope or function scope statement is parsed, the child ProjectAST is created
and pushed onto the stack. Therefore all statements which belong to the scope
or function scope are added as childs to their direct parent (scope or function scope).
*/
//QValueStack<ProjectAST*> projects;
/**
The current depth of AST node is stored here.
AST depth is important to know because automatic indentation can
be easily implemented (the parser itself looses all information
about indentation).
*/
// int depth = 0;
/*
To debug this parser, put the line below into the next bison file section.
Don't forget to uncomment "yydebug = 1" line in qmakedriver.cpp.
%debug
*/
%}
%skeleton "lalr1.cc"
%define "parser_class_name" "Parser"
%name-prefix="QMake"
%parse-param { QMake::Lexer* lexer }
%parse-param { QValueStack<ProjectAST*>& projects }
%parse-param { int depth }
%lex-param { QMake::Lexer* lexer }
%start project
%token ID_SIMPLE
%token EQ
%token PLUSEQ
%token MINUSEQ
%token STAREQ
%token TILDEEQ
%token LBRACE
%token RBRACE
%token COLON
%token NEWLINE
%token COMMENT
%token CONT
%token COMMENT_CONT
%token RCURLY
%token LCURLY
%token ID_ARGS
%token QUOTED_VARIABLE_VALUE
%token VARIABLE_VALUE
%token LIST_WS
%token ENDOFFILE
%%
project :
{
ProjectAST *projectAST = new ProjectAST();
projects.push(projectAST);
}
statements
;
statements : statements statement
{
projects.top()->addChildAST($<node>2);
$<node>2->setDepth(depth);
}
|
;
statement : variable_assignment
{
$<node>$ = $<node>1;
}
| scope
{
$<node>$ = $<node>1;
}
| function_call
{
$<node>$ = $<node>1;
}
| comment
{
$<node>$ = $<node>1;
}
| emptyline
{
$<node>$ = new NewLineAST();
}
;
variable_assignment : ID_SIMPLE operator multiline_values listws NEWLINE
{
AssignmentAST *node = new AssignmentAST();
node->scopedID = $<value>1;
node->op = $<value>2;
node->values = $<values>3 ;
node->values.append( $<value>4 );
node->values.append( $<value>5 );
node->indent = $<indent>3;
$<node>$ = node;
}
| ID_SIMPLE operator multiline_values listws ENDOFFILE
{
AssignmentAST *node = new AssignmentAST();
node->scopedID = $<value>1;
node->op = $<value>2;
node->values = $<values>3 ;
node->values.append( $<value>4 );
node->indent = $<indent>3;
$<node>$ = node;
}
| ID_SIMPLE operator multiline_values listws CONT
{
AssignmentAST *node = new AssignmentAST();
node->scopedID = $<value>1;
node->op = $<value>2;
node->values = $<values>3 ;
node->values.append( $<value>4 );
node->values.append( $<value>5 );
node->indent = $<indent>3;
$<node>$ = node;
}
| ID_SIMPLE operator multiline_values listws COMMENT_CONT
{
AssignmentAST *node = new AssignmentAST();
node->scopedID = $<value>1;
node->op = $<value>2;
node->values = $<values>3 ;
node->values.append( $<value>4 );
node->values.append( $<value>5 );
node->indent = $<indent>3;
$<node>$ = node;
}
| ID_SIMPLE operator listws NEWLINE
{
AssignmentAST *node = new AssignmentAST();
node->scopedID = $<value>1;
node->op = $<value>2;
node->values.append( $<value>3 );
node->values.append( $<value>4 );
$<node>$ = node;
}
| ID_SIMPLE operator listws ENDOFFILE
{
AssignmentAST *node = new AssignmentAST();
node->scopedID = $<value>1;
node->op = $<value>2;
node->values.append( $<value>3 );
$<node>$ = node;
}
| ID_SIMPLE operator listws COMMENT
{
AssignmentAST *node = new AssignmentAST();
node->scopedID = $<value>1;
node->op = $<value>2;
node->values.append( $<value>3 );
node->values.append( $<value>4 );
$<node>$ = node;
}
| ID_SIMPLE operator multiline_values listws COMMENT
{
AssignmentAST *node = new AssignmentAST();
node->scopedID = $<value>1;
node->op = $<value>2;
node->values = $<values>3;
node->values.append( $<value>4 );
node->values.append( $<value>5 );
node->indent = $<indent>3;
$<node>$ = node;
}
;
possible_value : variable_value | COMMENT_CONT | CONT
multiline_values : multiline_values LIST_WS possible_value
{
$<values>$.append( $<value>2 );
$<values>$.append( $<value>3 );
}
| multiline_values variable_value
{
$<values>$.append( $<value>2 );
}
| multiline_values listws CONT listws possible_value
{
$<values>$.append( $<value>2 );
$<values>$.append( $<value>3 );
$<values>$.append( $<value>4 );
$<values>$.append( $<value>5 );
if( $<indent>4 != "" && $<indent>$ == "" )
$<indent>$ = $<indent>4;
}
| multiline_values listws COMMENT_CONT listws possible_value
{
$<values>$.append( $<value>2 );
$<values>$.append( $<value>3 );
$<values>$.append( $<value>4 );
$<values>$.append( $<value>5 );
if( $<indent>4 != "" && $<indent>$ == "" )
$<indent>$ = $<indent>4;
}
| listws possible_value
{
$<values>$ = QStringList();
$<values>$.append( $<value>1 );
$<values>$.append( $<value>2 );
}
;
variable_value : VARIABLE_VALUE { $<value>$ = $<value>1; }
| QUOTED_VARIABLE_VALUE { $<value>$ = $<value>1; }
;
listws: LIST_WS
{
$<value>$ = $<value>1;
$<indent>$ = $<value>1;
}
|
{
$<value>$ = QString();
$<indent>$ = QString();
}
;
operator : EQ
{
$<value>$ = $<value>1;
}
| PLUSEQ
{
$<value>$ = $<value>1;
}
| MINUSEQ
{
$<value>$ = $<value>1;
}
| STAREQ
{
$<value>$ = $<value>1;
}
| TILDEEQ
{
$<value>$ = $<value>1;
}
;
scope : ID_SIMPLE
{
ProjectAST *projectAST = new ProjectAST(ProjectAST::Scope);
projects.push(projectAST);
projects.top()->scopedID = $<value>1;
depth++;
}
scope_body
{
$<node>$ = projects.pop();
depth--;
}
;
function_call : ID_SIMPLE LBRACE function_args RBRACE
{
ProjectAST *projectAST = new ProjectAST(ProjectAST::FunctionScope);
projects.push(projectAST);
projects.top()->scopedID = $<value>1;
projects.top()->args = $<value>3;
depth++;
//qWarning("%s", $<value>1.ascii());
if ($<value>1.contains("include"))
{
IncludeAST *includeAST = new IncludeAST();
includeAST->projectName = $<value>3;
projects.top()->addChildAST(includeAST);
includeAST->setDepth(depth);
}
}
scope_body
else_statement
{
$<node>$ = projects.pop();
depth--;
}
;
function_args : ID_ARGS { $<value>$ = $<value>1; }
| { $<value>$ = ""; }
;
scope_body : LCURLY statements RCURLY
| COLON statement
{
projects.top()->addChildAST($<node>2);
$<node>2->setDepth(depth);
}
|
;
else_statement : "else" LCURLY
{
ProjectAST *projectAST = new ProjectAST(ProjectAST::FunctionScope);
projects.push(projectAST);
projects.top()->scopedID = "else";
projects.top()->args = "";
depth++;
}
scope_body RCURLY
{
$<node>$ = projects.pop();
depth--;
}
|
{
$<node>$ = new ProjectAST();
}
;
comment : COMMENT
{
CommentAST *node = new CommentAST();
node->comment = $<value>1;
$<node>$ = node;
}
;
emptyline : NEWLINE
;
%%
namespace QMake
{
void Parser::error(const location_type& /*l*/, const std::string& m)
{
std::cerr << m << std::endl;
}
}
|