blob: bd078c8ec71e09a72b9343dc011a4490375fc78f [file] [log] [blame]
drh75897232000-05-29 14:26:00 +00001<html>
2<head>
3<title>The Lemon Parser Generator</title>
4</head>
drh60c71b02020-09-01 11:20:03 +00005<body>
6<a id="main"></a>
drh9a243e62017-09-20 09:09:34 +00007<h1 align='center'>The Lemon Parser Generator</h1>
drh75897232000-05-29 14:26:00 +00008
drh9bccde32016-03-19 18:00:44 +00009<p>Lemon is an LALR(1) parser generator for C.
10It does the same job as "bison" and "yacc".
drh9a243e62017-09-20 09:09:34 +000011But Lemon is not a bison or yacc clone. Lemon
drh75897232000-05-29 14:26:00 +000012uses a different grammar syntax which is designed to
drh9bccde32016-03-19 18:00:44 +000013reduce the number of coding errors. Lemon also uses a
14parsing engine that is faster than yacc and
15bison and which is both reentrant and threadsafe.
16(Update: Since the previous sentence was written, bison
17has also been updated so that it too can generate a
18reentrant and threadsafe parser.)
19Lemon also implements features that can be used
drh9a243e62017-09-20 09:09:34 +000020to eliminate resource leaks, making it suitable for use
drh75897232000-05-29 14:26:00 +000021in long-running programs such as graphical user interfaces
22or embedded controllers.</p>
23
24<p>This document is an introduction to the Lemon
25parser generator.</p>
26
drh60c71b02020-09-01 11:20:03 +000027<a id="toc"></a>
28<h2>1.0 Table of Contents</h2>
29<ul>
30<li><a href="#main">Introduction</a>
31<li><a href="#toc">1.0 Table of Contents</a>
32<li><a href="#secnot">2.0 Security Notes</a><br>
33<li><a href="#optheory">3.0 Theory of Operation</a>
34 <ul>
35 <li><a href="#options">3.1 Command Line Options</a>
36 <li><a href="#interface">3.2 The Parser Interface</a>
37 <ul>
38 <li><a href="#onstack">3.2.1 Allocating The Parse Object On Stack</a>
39 <li><a href="#ifsum">3.2.2 Interface Summary</a>
40 </ul>
41 <li><a href="#yaccdiff">3.3 Differences With YACC and BISON</a>
42 <li><a href="#build">3.4 Building The "lemon" Or "lemon.exe" Executable</a>
43 </ul>
44<li><a href="#syntax">4.0 Input File Syntax</a>
45 <ul>
46 <li><a href="#tnt">4.1 Terminals and Nonterminals</a>
47 <li><a href="#rules">4.2 Grammar Rules</a>
48 <li><a href="#precrules">4.3 Precedence Rules</a>
49 <li><a href="#special">4.4 Special Directives</a>
50 </ul>
51<li><a href="#errors">5.0 Error Processing</a>
52<li><a href="#history">6.0 History of Lemon</a>
53<li><a href="#copyright">7.0 Copyright</a>
54</ul>
55
56<a id="secnot"></a>
57<h2>2.0 Security Note</h2>
drhc5e56b32017-06-01 01:53:19 +000058
59<p>The language parser code created by Lemon is very robust and
60is well-suited for use in internet-facing applications that need to
drh7b852412020-08-28 13:10:00 +000061safely process maliciously crafted inputs.</p>
drhc5e56b32017-06-01 01:53:19 +000062
63<p>The "lemon.exe" command-line tool itself works great when given a valid
64input grammar file and almost always gives helpful
65error messages for malformed inputs. However, it is possible for
66a malicious user to craft a grammar file that will cause
67lemon.exe to crash.
68We do not see this as a problem, as lemon.exe is not intended to be used
69with hostile inputs.
70To summarize:</p>
71
72<ul>
73<li>Parser code generated by lemon &rarr; Robust and secure
74<li>The "lemon.exe" command line tool itself &rarr; Not so much
75</ul>
76
drh60c71b02020-09-01 11:20:03 +000077<a id="optheory"></a>
78<h2>3.0 Theory of Operation</h2>
drh75897232000-05-29 14:26:00 +000079
drh60c71b02020-09-01 11:20:03 +000080<p>Lemon is computer program that translates a context free grammar (CFG)
drh75897232000-05-29 14:26:00 +000081for a particular language into C code that implements a parser for
82that language.
drh60c71b02020-09-01 11:20:03 +000083The Lemon program has two inputs:</p>
drh75897232000-05-29 14:26:00 +000084<ul>
85<li>The grammar specification.
86<li>A parser template file.
87</ul>
drh7b852412020-08-28 13:10:00 +000088<p>Typically, only the grammar specification is supplied by the programmer.
drh60c71b02020-09-01 11:20:03 +000089Lemon comes with a default parser template
90("<a href="https://sqlite.org/src/file/tool/lempar.c">lempar.c</a>")
91that works fine for most applications. But the user is free to substitute
92a different parser template if desired.</p>
drh75897232000-05-29 14:26:00 +000093
drh9a243e62017-09-20 09:09:34 +000094<p>Depending on command-line options, Lemon will generate up to
drh7b852412020-08-28 13:10:00 +000095three output files.</p>
drh75897232000-05-29 14:26:00 +000096<ul>
drh60c71b02020-09-01 11:20:03 +000097<li>C code to implement a parser for the input grammar.
98<li>A header file defining an integer ID for each terminal symbol
99 (or "token").
drh75897232000-05-29 14:26:00 +0000100<li>An information file that describes the states of the generated parser
101 automaton.
102</ul>
drh7b852412020-08-28 13:10:00 +0000103<p>By default, all three of these output files are generated.
drh9bccde32016-03-19 18:00:44 +0000104The header file is suppressed if the "-m" command-line option is
105used and the report file is omitted when "-q" is selected.</p>
drh75897232000-05-29 14:26:00 +0000106
drh9bccde32016-03-19 18:00:44 +0000107<p>The grammar specification file uses a ".y" suffix, by convention.
drh75897232000-05-29 14:26:00 +0000108In the examples used in this document, we'll assume the name of the
drh9bccde32016-03-19 18:00:44 +0000109grammar file is "gram.y". A typical use of Lemon would be the
drh7b852412020-08-28 13:10:00 +0000110following command:</p>
drh75897232000-05-29 14:26:00 +0000111<pre>
112 lemon gram.y
113</pre>
drh7b852412020-08-28 13:10:00 +0000114<p>This command will generate three output files named "gram.c",
drh9bccde32016-03-19 18:00:44 +0000115"gram.h" and "gram.out".
drh75897232000-05-29 14:26:00 +0000116The first is C code to implement the parser. The second
117is the header file that defines numerical values for all
118terminal symbols, and the last is the report that explains
119the states used by the parser automaton.</p>
120
drh60c71b02020-09-01 11:20:03 +0000121<a id="options"></a>
122<h3>3.1 Command Line Options</h3>
drh75897232000-05-29 14:26:00 +0000123
124<p>The behavior of Lemon can be modified using command-line options.
125You can obtain a list of the available command-line options together
drh7b852412020-08-28 13:10:00 +0000126with a brief explanation of what each does by typing</p>
drh75897232000-05-29 14:26:00 +0000127<pre>
drh9a243e62017-09-20 09:09:34 +0000128 lemon "-?"
drh75897232000-05-29 14:26:00 +0000129</pre>
drh7b852412020-08-28 13:10:00 +0000130<p>As of this writing, the following command-line options are supported:</p>
drh75897232000-05-29 14:26:00 +0000131<ul>
drh9bccde32016-03-19 18:00:44 +0000132<li><b>-b</b>
133Show only the basis for each parser state in the report file.
134<li><b>-c</b>
drh9a243e62017-09-20 09:09:34 +0000135Do not compress the generated action tables. The parser will be a
136little larger and slower, but it will detect syntax errors sooner.
drhfb32c442018-04-21 13:51:42 +0000137<li><b>-d</b><i>directory</i>
138Write all output files into <i>directory</i>. Normally, output files
139are written into the directory that contains the input grammar file.
drh9bccde32016-03-19 18:00:44 +0000140<li><b>-D<i>name</i></b>
drh9a243e62017-09-20 09:09:34 +0000141Define C preprocessor macro <i>name</i>. This macro is usable by
drh5f0d37b2020-07-03 18:07:22 +0000142"<tt><a href='#pifdef'>%ifdef</a></tt>",
143"<tt><a href='#pifdef'>%ifndef</a></tt>", and
144"<tt><a href="#pifdef">%if</a></tt> lines
drh9a243e62017-09-20 09:09:34 +0000145in the grammar file.
drh5f0d37b2020-07-03 18:07:22 +0000146<li><b>-E</b>
147Run the "%if" preprocessor step only and print the revised grammar
148file.
drh9bccde32016-03-19 18:00:44 +0000149<li><b>-g</b>
150Do not generate a parser. Instead write the input grammar to standard
151output with all comments, actions, and other extraneous text removed.
152<li><b>-l</b>
drhdfe4e6b2016-10-08 13:34:08 +0000153Omit "#line" directives in the generated parser C code.
drh9bccde32016-03-19 18:00:44 +0000154<li><b>-m</b>
155Cause the output C source code to be compatible with the "makeheaders"
drh9a243e62017-09-20 09:09:34 +0000156program.
drh9bccde32016-03-19 18:00:44 +0000157<li><b>-p</b>
drh9a243e62017-09-20 09:09:34 +0000158Display all conflicts that are resolved by
drh9bccde32016-03-19 18:00:44 +0000159<a href='#precrules'>precedence rules</a>.
160<li><b>-q</b>
161Suppress generation of the report file.
162<li><b>-r</b>
163Do not sort or renumber the parser states as part of optimization.
164<li><b>-s</b>
drhed5e6682020-03-09 01:02:45 +0000165Show parser statistics before exiting.
drh9bccde32016-03-19 18:00:44 +0000166<li><b>-T<i>file</i></b>
167Use <i>file</i> as the template for the generated C-code parser implementation.
168<li><b>-x</b>
169Print the Lemon version number.
drh75897232000-05-29 14:26:00 +0000170</ul>
drh75897232000-05-29 14:26:00 +0000171
drh60c71b02020-09-01 11:20:03 +0000172<a id="interface"></a>
173<h3>3.2 The Parser Interface</h3>
drh75897232000-05-29 14:26:00 +0000174
175<p>Lemon doesn't generate a complete, working program. It only generates
176a few subroutines that implement a parser. This section describes
177the interface to those subroutines. It is up to the programmer to
178call these subroutines in an appropriate way in order to produce a
179complete system.</p>
180
181<p>Before a program begins using a Lemon-generated parser, the program
182must first create the parser.
drh7b852412020-08-28 13:10:00 +0000183A new parser is created as follows:</p>
drh75897232000-05-29 14:26:00 +0000184<pre>
185 void *pParser = ParseAlloc( malloc );
186</pre>
drh7b852412020-08-28 13:10:00 +0000187<p>The ParseAlloc() routine allocates and initializes a new parser and
drh75897232000-05-29 14:26:00 +0000188returns a pointer to it.
drh9bccde32016-03-19 18:00:44 +0000189The actual data structure used to represent a parser is opaque &mdash;
drh75897232000-05-29 14:26:00 +0000190its internal structure is not visible or usable by the calling routine.
191For this reason, the ParseAlloc() routine returns a pointer to void
192rather than a pointer to some particular structure.
193The sole argument to the ParseAlloc() routine is a pointer to the
drh9bccde32016-03-19 18:00:44 +0000194subroutine used to allocate memory. Typically this means malloc().</p>
drh75897232000-05-29 14:26:00 +0000195
196<p>After a program is finished using a parser, it can reclaim all
drh7b852412020-08-28 13:10:00 +0000197memory allocated by that parser by calling</p>
drh75897232000-05-29 14:26:00 +0000198<pre>
199 ParseFree(pParser, free);
200</pre>
drh7b852412020-08-28 13:10:00 +0000201<p>The first argument is the same pointer returned by ParseAlloc(). The
drh75897232000-05-29 14:26:00 +0000202second argument is a pointer to the function used to release bulk
203memory back to the system.</p>
204
205<p>After a parser has been allocated using ParseAlloc(), the programmer
206must supply the parser with a sequence of tokens (terminal symbols) to
207be parsed. This is accomplished by calling the following function
drh7b852412020-08-28 13:10:00 +0000208once for each token:<p>
drh75897232000-05-29 14:26:00 +0000209<pre>
210 Parse(pParser, hTokenID, sTokenData, pArg);
211</pre>
drh7b852412020-08-28 13:10:00 +0000212<p>The first argument to the Parse() routine is the pointer returned by
drh75897232000-05-29 14:26:00 +0000213ParseAlloc().
drh9a243e62017-09-20 09:09:34 +0000214The second argument is a small positive integer that tells the parser the
drh75897232000-05-29 14:26:00 +0000215type of the next token in the data stream.
216There is one token type for each terminal symbol in the grammar.
217The gram.h file generated by Lemon contains #define statements that
218map symbolic terminal symbol names into appropriate integer values.
drh9bccde32016-03-19 18:00:44 +0000219A value of 0 for the second argument is a special flag to the
220parser to indicate that the end of input has been reached.
drh75897232000-05-29 14:26:00 +0000221The third argument is the value of the given token. By default,
drh9a243e62017-09-20 09:09:34 +0000222the type of the third argument is "void*", but the grammar will
drh75897232000-05-29 14:26:00 +0000223usually redefine this type to be some kind of structure.
224Typically the second argument will be a broad category of tokens
drh9bccde32016-03-19 18:00:44 +0000225such as "identifier" or "number" and the third argument will
drh75897232000-05-29 14:26:00 +0000226be the name of the identifier or the value of the number.</p>
227
228<p>The Parse() function may have either three or four arguments,
drh45f31be2016-02-16 21:19:49 +0000229depending on the grammar. If the grammar specification file requests
drh9a243e62017-09-20 09:09:34 +0000230it (via the <tt><a href='#extraarg'>%extra_argument</a></tt> directive),
drh45f31be2016-02-16 21:19:49 +0000231the Parse() function will have a fourth parameter that can be
drh75897232000-05-29 14:26:00 +0000232of any type chosen by the programmer. The parser doesn't do anything
233with this argument except to pass it through to action routines.
234This is a convenient mechanism for passing state information down
235to the action routines without having to use global variables.</p>
236
237<p>A typical use of a Lemon parser might look something like the
drh7b852412020-08-28 13:10:00 +0000238following:</p>
drh75897232000-05-29 14:26:00 +0000239<pre>
drh9a243e62017-09-20 09:09:34 +0000240 1 ParseTree *ParseFile(const char *zFilename){
241 2 Tokenizer *pTokenizer;
242 3 void *pParser;
243 4 Token sToken;
244 5 int hTokenId;
245 6 ParserState sState;
246 7
247 8 pTokenizer = TokenizerCreate(zFilename);
248 9 pParser = ParseAlloc( malloc );
249 10 InitParserState(&amp;sState);
250 11 while( GetNextToken(pTokenizer, &amp;hTokenId, &amp;sToken) ){
251 12 Parse(pParser, hTokenId, sToken, &amp;sState);
drh75897232000-05-29 14:26:00 +0000252 13 }
drh9a243e62017-09-20 09:09:34 +0000253 14 Parse(pParser, 0, sToken, &amp;sState);
drh75897232000-05-29 14:26:00 +0000254 15 ParseFree(pParser, free );
255 16 TokenizerFree(pTokenizer);
256 17 return sState.treeRoot;
257 18 }
258</pre>
drh7b852412020-08-28 13:10:00 +0000259<p>This example shows a user-written routine that parses a file of
drh75897232000-05-29 14:26:00 +0000260text and returns a pointer to the parse tree.
drh9bccde32016-03-19 18:00:44 +0000261(All error-handling code is omitted from this example to keep it
drh75897232000-05-29 14:26:00 +0000262simple.)
263We assume the existence of some kind of tokenizer which is created
264using TokenizerCreate() on line 8 and deleted by TokenizerFree()
265on line 16. The GetNextToken() function on line 11 retrieves the
drh9a243e62017-09-20 09:09:34 +0000266next token from the input file and puts its type in the
drh75897232000-05-29 14:26:00 +0000267integer variable hTokenId. The sToken variable is assumed to be
268some kind of structure that contains details about each token,
drh9a243e62017-09-20 09:09:34 +0000269such as its complete text, what line it occurs on, etc.</p>
drh75897232000-05-29 14:26:00 +0000270
drh7b852412020-08-28 13:10:00 +0000271<p>This example also assumes the existence of a structure of type
drh75897232000-05-29 14:26:00 +0000272ParserState that holds state information about a particular parse.
273An instance of such a structure is created on line 6 and initialized
274on line 10. A pointer to this structure is passed into the Parse()
275routine as the optional 4th argument.
276The action routine specified by the grammar for the parser can use
277the ParserState structure to hold whatever information is useful and
278appropriate. In the example, we note that the treeRoot field of
279the ParserState structure is left pointing to the root of the parse
280tree.</p>
281
drh7b852412020-08-28 13:10:00 +0000282<p>The core of this example as it relates to Lemon is as follows:</p>
drh75897232000-05-29 14:26:00 +0000283<pre>
284 ParseFile(){
285 pParser = ParseAlloc( malloc );
drh9a243e62017-09-20 09:09:34 +0000286 while( GetNextToken(pTokenizer,&amp;hTokenId, &amp;sToken) ){
drh75897232000-05-29 14:26:00 +0000287 Parse(pParser, hTokenId, sToken);
288 }
289 Parse(pParser, 0, sToken);
290 ParseFree(pParser, free );
291 }
292</pre>
drh7b852412020-08-28 13:10:00 +0000293<p>Basically, what a program has to do to use a Lemon-generated parser
drh75897232000-05-29 14:26:00 +0000294is first create the parser, then send it lots of tokens obtained by
295tokenizing an input source. When the end of input is reached, the
296Parse() routine should be called one last time with a token type
297of 0. This step is necessary to inform the parser that the end of
298input has been reached. Finally, we reclaim memory used by the
299parser by calling ParseFree().</p>
300
301<p>There is one other interface routine that should be mentioned
302before we move on.
303The ParseTrace() function can be used to generate debugging output
drh7b852412020-08-28 13:10:00 +0000304from the parser. A prototype for this routine is as follows:</p>
drh75897232000-05-29 14:26:00 +0000305<pre>
306 ParseTrace(FILE *stream, char *zPrefix);
307</pre>
drh7b852412020-08-28 13:10:00 +0000308<p>After this routine is called, a short (one-line) message is written
drh75897232000-05-29 14:26:00 +0000309to the designated output stream every time the parser changes states
310or calls an action routine. Each such message is prefaced using
311the text given by zPrefix. This debugging output can be turned off
312by calling ParseTrace() again with a first argument of NULL (0).</p>
313
drh60c71b02020-09-01 11:20:03 +0000314<a id="onstack"></a>
315<h4>3.2.1 Allocating The Parse Object On Stack</h4>
316
317<p>If all calls to the Parse() interface are made from within
318<a href="#pcode"><tt>%code</tt> directives</a>, then the parse
319object can be allocated from the stack rather than from the heap.
320These are the steps:
321
322<ul>
323<li> Declare a local variable of type "yyParser"
324<li> Initialize the variable using ParseInit()
325<li> Pass a pointer to the variable in calls ot Parse()
326<li> Deallocate substructure in the parse variable using ParseFinalize().
327</ul>
328
329<p>The following code illustrates how this is done:
330
331<pre>
332 ParseFile(){
333 yyParser x;
334 ParseInit( &x );
335 while( GetNextToken(pTokenizer,&amp;hTokenId, &amp;sToken) ){
336 Parse(&x, hTokenId, sToken);
337 }
338 Parse(&x, 0, sToken);
339 ParseFinalize( &x );
340 }
341</pre>
342
343<a id="ifsum"></a>
344<h4>3.2.2 Interface Summary</h4>
345
346<p>Here is a quick overview of the C-language interface to a
347Lemon-generated parser:</p>
348
349<blockquote><pre>
350void *ParseAlloc( (void*(*malloc)(size_t) );
351void ParseFree(void *pParser, (void(*free)(void*) );
352void Parse(void *pParser, int tokenCode, ParseTOKENTYPE token, ...);
353void ParseTrace(FILE *stream, char *zPrefix);
354</pre></blockquote>
355
356<p>Notes:</p>
357<ul>
358<li> Use the <a href="#pname"><tt>%name</tt> directive</a> to change
359the "Parse" prefix names of the procedures in the interface.
360<li> Use the <a href="#token_type"><tt>%token_type</tt> directive</a>
361to define the "ParseTOKENTYPE" type.
362<li> Use the <a href="#extraarg"><tt>%extra_argument</tt> directive</a>
363to specify the type and name of the 4th parameter to the
364Parse() function.
365</ul>
366
367<a id="yaccdiff"></a>
368<h3>3.3 Differences With YACC and BISON</h3>
drh75897232000-05-29 14:26:00 +0000369
370<p>Programmers who have previously used the yacc or bison parser
371generator will notice several important differences between yacc and/or
drh7b852412020-08-28 13:10:00 +0000372bison and Lemon.</p>
drh75897232000-05-29 14:26:00 +0000373<ul>
374<li>In yacc and bison, the parser calls the tokenizer. In Lemon,
375 the tokenizer calls the parser.
376<li>Lemon uses no global variables. Yacc and bison use global variables
377 to pass information between the tokenizer and parser.
378<li>Lemon allows multiple parsers to be running simultaneously. Yacc
379 and bison do not.
380</ul>
drh7b852412020-08-28 13:10:00 +0000381<p>These differences may cause some initial confusion for programmers
drh75897232000-05-29 14:26:00 +0000382with prior yacc and bison experience.
383But after years of experience using Lemon, I firmly
384believe that the Lemon way of doing things is better.</p>
385
drh45f31be2016-02-16 21:19:49 +0000386<p><i>Updated as of 2016-02-16:</i>
387The text above was written in the 1990s.
388We are told that Bison has lately been enhanced to support the
drh60c71b02020-09-01 11:20:03 +0000389tokenizer-calls-parser paradigm used by Lemon, eliminating the
drh45f31be2016-02-16 21:19:49 +0000390need for global variables.</p>
391
drh60c71b02020-09-01 11:20:03 +0000392<a id="build"><a>
393<h3>3.4 Building The "lemon" or "lemon.exe" Executable</h3>
394
395<p>The "lemon" or "lemon.exe" program is built from a single file
396of C-code named
397"<a href="https://sqlite.org/src/tool/lemon.c">lemon.c</a>".
398The Lemon source code is generic C89 code that uses
399no unusual or non-standard libraries. Any
400reasonable C compiler should suffice to compile the lemon program.
401A command-line like the following will usually work:</p>
402
403<blockquote><pre>
404cc -o lemon lemon.c
405</pre></blockquote
406
407<p>On Windows machines with Visual C++ installed, bring up a
408"VS20<i>NN</i> x64 Native Tools Command Prompt" window and enter:
409
410<blockquote><pre>
411cl lemon.c
412</pre></blockquote>
413
414<p>Compiling Lemon really is that simple.
415Additional compiler options such as
416"-O2" or "-g" or "-Wall" can be added if desired, but they are not
417necessary.</p>
418
419
420<a id="syntax"></a>
421<h2>4.0 Input File Syntax</h2>
drh75897232000-05-29 14:26:00 +0000422
423<p>The main purpose of the grammar specification file for Lemon is
424to define the grammar for the parser. But the input file also
425specifies additional information Lemon requires to do its job.
426Most of the work in using Lemon is in writing an appropriate
427grammar file.</p>
428
drh7b852412020-08-28 13:10:00 +0000429<p>The grammar file for Lemon is, for the most part, a free format.
drh75897232000-05-29 14:26:00 +0000430It does not have sections or divisions like yacc or bison. Any
drh7b852412020-08-28 13:10:00 +0000431declaration can occur at any point in the file. Lemon ignores
432whitespace (except where it is needed to separate tokens), and it
433honors the same commenting conventions as C and C++.</p>
drh75897232000-05-29 14:26:00 +0000434
drh60c71b02020-09-01 11:20:03 +0000435<a id="tnt"></a>
436<h3>4.1 Terminals and Nonterminals</h3>
drh75897232000-05-29 14:26:00 +0000437
438<p>A terminal symbol (token) is any string of alphanumeric
drh9bccde32016-03-19 18:00:44 +0000439and/or underscore characters
drh9a243e62017-09-20 09:09:34 +0000440that begins with an uppercase letter.
drhc8eee5e2011-07-30 23:50:12 +0000441A terminal can contain lowercase letters after the first character,
drh9a243e62017-09-20 09:09:34 +0000442but the usual convention is to make terminals all uppercase.
drh75897232000-05-29 14:26:00 +0000443A nonterminal, on the other hand, is any string of alphanumeric
drh9a243e62017-09-20 09:09:34 +0000444and underscore characters than begins with a lowercase letter.
445Again, the usual convention is to make nonterminals use all lowercase
446letters.</p>
drh75897232000-05-29 14:26:00 +0000447
drh9a243e62017-09-20 09:09:34 +0000448<p>In Lemon, terminal and nonterminal symbols do not need to
drh75897232000-05-29 14:26:00 +0000449be declared or identified in a separate section of the grammar file.
450Lemon is able to generate a list of all terminals and nonterminals
451by examining the grammar rules, and it can always distinguish a
452terminal from a nonterminal by checking the case of the first
453character of the name.</p>
454
455<p>Yacc and bison allow terminal symbols to have either alphanumeric
456names or to be individual characters included in single quotes, like
457this: ')' or '$'. Lemon does not allow this alternative form for
458terminal symbols. With Lemon, all symbols, terminals and nonterminals,
459must have alphanumeric names.</p>
460
drh60c71b02020-09-01 11:20:03 +0000461<a id="rules"></a>
462<h3>4.2 Grammar Rules</h3>
drh75897232000-05-29 14:26:00 +0000463
464<p>The main component of a Lemon grammar file is a sequence of grammar
465rules.
466Each grammar rule consists of a nonterminal symbol followed by
drh9bccde32016-03-19 18:00:44 +0000467the special symbol "::=" and then a list of terminals and/or nonterminals.
drh75897232000-05-29 14:26:00 +0000468The rule is terminated by a period.
469The list of terminals and nonterminals on the right-hand side of the
470rule can be empty.
471Rules can occur in any order, except that the left-hand side of the
472first rule is assumed to be the start symbol for the grammar (unless
drh9a243e62017-09-20 09:09:34 +0000473specified otherwise using the <tt><a href='#start_symbol'>%start_symbol</a></tt>
474directive described below.)
drh7b852412020-08-28 13:10:00 +0000475A typical sequence of grammar rules might look something like this:</p>
drh75897232000-05-29 14:26:00 +0000476<pre>
477 expr ::= expr PLUS expr.
478 expr ::= expr TIMES expr.
479 expr ::= LPAREN expr RPAREN.
480 expr ::= VALUE.
481</pre>
drh75897232000-05-29 14:26:00 +0000482
drh9bccde32016-03-19 18:00:44 +0000483<p>There is one non-terminal in this example, "expr", and five
484terminal symbols or tokens: "PLUS", "TIMES", "LPAREN",
485"RPAREN" and "VALUE".</p>
drh75897232000-05-29 14:26:00 +0000486
487<p>Like yacc and bison, Lemon allows the grammar to specify a block
488of C code that will be executed whenever a grammar rule is reduced
489by the parser.
490In Lemon, this action is specified by putting the C code (contained
491within curly braces <tt>{...}</tt>) immediately after the
492period that closes the rule.
drh7b852412020-08-28 13:10:00 +0000493For example:</p>
drh75897232000-05-29 14:26:00 +0000494<pre>
495 expr ::= expr PLUS expr. { printf("Doing an addition...\n"); }
496</pre>
drh75897232000-05-29 14:26:00 +0000497
498<p>In order to be useful, grammar actions must normally be linked to
499their associated grammar rules.
drh9bccde32016-03-19 18:00:44 +0000500In yacc and bison, this is accomplished by embedding a "$$" in the
drh75897232000-05-29 14:26:00 +0000501action to stand for the value of the left-hand side of the rule and
drh9bccde32016-03-19 18:00:44 +0000502symbols "$1", "$2", and so forth to stand for the value of
drh75897232000-05-29 14:26:00 +0000503the terminal or nonterminal at position 1, 2 and so forth on the
504right-hand side of the rule.
505This idea is very powerful, but it is also very error-prone. The
506single most common source of errors in a yacc or bison grammar is
507to miscount the number of symbols on the right-hand side of a grammar
drh9bccde32016-03-19 18:00:44 +0000508rule and say "$7" when you really mean "$8".</p>
drh75897232000-05-29 14:26:00 +0000509
510<p>Lemon avoids the need to count grammar symbols by assigning symbolic
511names to each symbol in a grammar rule and then using those symbolic
512names in the action.
drh7b852412020-08-28 13:10:00 +0000513In yacc or bison, one would write this:</p>
drh75897232000-05-29 14:26:00 +0000514<pre>
drh9a243e62017-09-20 09:09:34 +0000515 expr -&gt; expr PLUS expr { $$ = $1 + $3; };
drh75897232000-05-29 14:26:00 +0000516</pre>
drh7b852412020-08-28 13:10:00 +0000517<p>But in Lemon, the same rule becomes the following:</p>
drh75897232000-05-29 14:26:00 +0000518<pre>
519 expr(A) ::= expr(B) PLUS expr(C). { A = B+C; }
520</pre>
drh7b852412020-08-28 13:10:00 +0000521<p>In the Lemon rule, any symbol in parentheses after a grammar rule
drh75897232000-05-29 14:26:00 +0000522symbol becomes a place holder for that symbol in the grammar rule.
523This place holder can then be used in the associated C action to
drh7b852412020-08-28 13:10:00 +0000524stand for the value of that symbol.</p>
drh75897232000-05-29 14:26:00 +0000525
526<p>The Lemon notation for linking a grammar rule with its reduce
527action is superior to yacc/bison on several counts.
528First, as mentioned above, the Lemon method avoids the need to
529count grammar symbols.
530Secondly, if a terminal or nonterminal in a Lemon grammar rule
531includes a linking symbol in parentheses but that linking symbol
532is not actually used in the reduce action, then an error message
533is generated.
drh7b852412020-08-28 13:10:00 +0000534For example, the rule</p>
drh75897232000-05-29 14:26:00 +0000535<pre>
536 expr(A) ::= expr(B) PLUS expr(C). { A = B; }
537</pre>
drh7b852412020-08-28 13:10:00 +0000538<p>will generate an error because the linking symbol "C" is used
drh75897232000-05-29 14:26:00 +0000539in the grammar rule but not in the reduce action.</p>
540
541<p>The Lemon notation for linking grammar rules to reduce actions
542also facilitates the use of destructors for reclaiming memory
543allocated by the values of terminals and nonterminals on the
544right-hand side of a rule.</p>
545
drh7b852412020-08-28 13:10:00 +0000546<a id='precrules'></a>
drh60c71b02020-09-01 11:20:03 +0000547<h3>4.3 Precedence Rules</h3>
drh75897232000-05-29 14:26:00 +0000548
549<p>Lemon resolves parsing ambiguities in exactly the same way as
550yacc and bison. A shift-reduce conflict is resolved in favor
551of the shift, and a reduce-reduce conflict is resolved by reducing
552whichever rule comes first in the grammar file.</p>
553
554<p>Just like in
drh9a243e62017-09-20 09:09:34 +0000555yacc and bison, Lemon allows a measure of control
556over the resolution of parsing conflicts using precedence rules.
drh75897232000-05-29 14:26:00 +0000557A precedence value can be assigned to any terminal symbol
drh9a243e62017-09-20 09:09:34 +0000558using the
559<tt><a href='#pleft'>%left</a></tt>,
560<tt><a href='#pright'>%right</a></tt> or
561<tt><a href='#pnonassoc'>%nonassoc</a></tt> directives. Terminal symbols
562mentioned in earlier directives have a lower precedence than
drh75897232000-05-29 14:26:00 +0000563terminal symbols mentioned in later directives. For example:</p>
564
drh7b852412020-08-28 13:10:00 +0000565<pre>
drh75897232000-05-29 14:26:00 +0000566 %left AND.
567 %left OR.
568 %nonassoc EQ NE GT GE LT LE.
569 %left PLUS MINUS.
570 %left TIMES DIVIDE MOD.
571 %right EXP NOT.
drh7b852412020-08-28 13:10:00 +0000572</pre>
drh75897232000-05-29 14:26:00 +0000573
574<p>In the preceding sequence of directives, the AND operator is
575defined to have the lowest precedence. The OR operator is one
576precedence level higher. And so forth. Hence, the grammar would
drh7b852412020-08-28 13:10:00 +0000577attempt to group the ambiguous expression</p>
drh75897232000-05-29 14:26:00 +0000578<pre>
579 a AND b OR c
580</pre>
drh7b852412020-08-28 13:10:00 +0000581<p>like this</p>
drh75897232000-05-29 14:26:00 +0000582<pre>
583 a AND (b OR c).
584</pre>
drh7b852412020-08-28 13:10:00 +0000585<p>The associativity (left, right or nonassoc) is used to determine
drh75897232000-05-29 14:26:00 +0000586the grouping when the precedence is the same. AND is left-associative
drh7b852412020-08-28 13:10:00 +0000587in our example, so</p>
drh75897232000-05-29 14:26:00 +0000588<pre>
589 a AND b AND c
590</pre>
drh7b852412020-08-28 13:10:00 +0000591<p>is parsed like this</p>
drh75897232000-05-29 14:26:00 +0000592<pre>
593 (a AND b) AND c.
594</pre>
drh7b852412020-08-28 13:10:00 +0000595<p>The EXP operator is right-associative, though, so</p>
drh75897232000-05-29 14:26:00 +0000596<pre>
597 a EXP b EXP c
598</pre>
drh7b852412020-08-28 13:10:00 +0000599<p>is parsed like this</p>
drh75897232000-05-29 14:26:00 +0000600<pre>
601 a EXP (b EXP c).
602</pre>
drh7b852412020-08-28 13:10:00 +0000603<p>The nonassoc precedence is used for non-associative operators.
604So</p>
drh75897232000-05-29 14:26:00 +0000605<pre>
606 a EQ b EQ c
607</pre>
drh7b852412020-08-28 13:10:00 +0000608<p>is an error.</p>
drh75897232000-05-29 14:26:00 +0000609
610<p>The precedence of non-terminals is transferred to rules as follows:
611The precedence of a grammar rule is equal to the precedence of the
612left-most terminal symbol in the rule for which a precedence is
613defined. This is normally what you want, but in those cases where
drhed5e6682020-03-09 01:02:45 +0000614you want the precedence of a grammar rule to be something different,
drh75897232000-05-29 14:26:00 +0000615you can specify an alternative precedence symbol by putting the
616symbol in square braces after the period at the end of the rule and
617before any C-code. For example:</p>
618
drh7b852412020-08-28 13:10:00 +0000619<pre>
drh75897232000-05-29 14:26:00 +0000620 expr = MINUS expr. [NOT]
drh7b852412020-08-28 13:10:00 +0000621</pre>
drh75897232000-05-29 14:26:00 +0000622
623<p>This rule has a precedence equal to that of the NOT symbol, not the
624MINUS symbol as would have been the case by default.</p>
625
626<p>With the knowledge of how precedence is assigned to terminal
627symbols and individual
628grammar rules, we can now explain precisely how parsing conflicts
629are resolved in Lemon. Shift-reduce conflicts are resolved
drh7b852412020-08-28 13:10:00 +0000630as follows:</p>
drh75897232000-05-29 14:26:00 +0000631<ul>
632<li> If either the token to be shifted or the rule to be reduced
633 lacks precedence information, then resolve in favor of the
634 shift, but report a parsing conflict.
635<li> If the precedence of the token to be shifted is greater than
636 the precedence of the rule to reduce, then resolve in favor
637 of the shift. No parsing conflict is reported.
drh9a243e62017-09-20 09:09:34 +0000638<li> If the precedence of the token to be shifted is less than the
drh75897232000-05-29 14:26:00 +0000639 precedence of the rule to reduce, then resolve in favor of the
640 reduce action. No parsing conflict is reported.
641<li> If the precedences are the same and the shift token is
642 right-associative, then resolve in favor of the shift.
643 No parsing conflict is reported.
drh9a243e62017-09-20 09:09:34 +0000644<li> If the precedences are the same and the shift token is
drh75897232000-05-29 14:26:00 +0000645 left-associative, then resolve in favor of the reduce.
646 No parsing conflict is reported.
drh9a243e62017-09-20 09:09:34 +0000647<li> Otherwise, resolve the conflict by doing the shift, and
648 report a parsing conflict.
drh75897232000-05-29 14:26:00 +0000649</ul>
drh7b852412020-08-28 13:10:00 +0000650<p>Reduce-reduce conflicts are resolved this way:</p>
drh75897232000-05-29 14:26:00 +0000651<ul>
drh9a243e62017-09-20 09:09:34 +0000652<li> If either reduce rule
drh75897232000-05-29 14:26:00 +0000653 lacks precedence information, then resolve in favor of the
drh9a243e62017-09-20 09:09:34 +0000654 rule that appears first in the grammar, and report a parsing
drh75897232000-05-29 14:26:00 +0000655 conflict.
drh9a243e62017-09-20 09:09:34 +0000656<li> If both rules have precedence and the precedence is different,
drh75897232000-05-29 14:26:00 +0000657 then resolve the dispute in favor of the rule with the highest
drh9a243e62017-09-20 09:09:34 +0000658 precedence, and do not report a conflict.
drh75897232000-05-29 14:26:00 +0000659<li> Otherwise, resolve the conflict by reducing by the rule that
drh9a243e62017-09-20 09:09:34 +0000660 appears first in the grammar, and report a parsing conflict.
drh75897232000-05-29 14:26:00 +0000661</ul>
662
drh60c71b02020-09-01 11:20:03 +0000663<a id="special"></a>
664<h3>4.4 Special Directives</h3>
drh75897232000-05-29 14:26:00 +0000665
666<p>The input grammar to Lemon consists of grammar rules and special
667directives. We've described all the grammar rules, so now we'll
668talk about the special directives.</p>
669
drh9a243e62017-09-20 09:09:34 +0000670<p>Directives in Lemon can occur in any order. You can put them before
671the grammar rules, or after the grammar rules, or in the midst of the
drh75897232000-05-29 14:26:00 +0000672grammar rules. It doesn't matter. The relative order of
673directives used to assign precedence to terminals is important, but
674other than that, the order of directives in Lemon is arbitrary.</p>
675
drh7b852412020-08-28 13:10:00 +0000676<p>Lemon supports the following special directives:</p>
drh75897232000-05-29 14:26:00 +0000677<ul>
drh9a243e62017-09-20 09:09:34 +0000678<li><tt><a href='#pcode'>%code</a></tt>
679<li><tt><a href='#default_destructor'>%default_destructor</a></tt>
680<li><tt><a href='#default_type'>%default_type</a></tt>
681<li><tt><a href='#destructor'>%destructor</a></tt>
drh5f0d37b2020-07-03 18:07:22 +0000682<li><tt><a href='#pifdef'>%else</a></tt>
drh9a243e62017-09-20 09:09:34 +0000683<li><tt><a href='#pifdef'>%endif</a></tt>
684<li><tt><a href='#extraarg'>%extra_argument</a></tt>
685<li><tt><a href='#pfallback'>%fallback</a></tt>
drh5f0d37b2020-07-03 18:07:22 +0000686<li><tt><a href='#pifdef'>%if</a></tt>
drh9a243e62017-09-20 09:09:34 +0000687<li><tt><a href='#pifdef'>%ifdef</a></tt>
688<li><tt><a href='#pifdef'>%ifndef</a></tt>
689<li><tt><a href='#pinclude'>%include</a></tt>
690<li><tt><a href='#pleft'>%left</a></tt>
691<li><tt><a href='#pname'>%name</a></tt>
692<li><tt><a href='#pnonassoc'>%nonassoc</a></tt>
693<li><tt><a href='#parse_accept'>%parse_accept</a></tt>
694<li><tt><a href='#parse_failure'>%parse_failure</a></tt>
695<li><tt><a href='#pright'>%right</a></tt>
696<li><tt><a href='#stack_overflow'>%stack_overflow</a></tt>
697<li><tt><a href='#stack_size'>%stack_size</a></tt>
698<li><tt><a href='#start_symbol'>%start_symbol</a></tt>
699<li><tt><a href='#syntax_error'>%syntax_error</a></tt>
700<li><tt><a href='#token_class'>%token_class</a></tt>
701<li><tt><a href='#token_destructor'>%token_destructor</a></tt>
702<li><tt><a href='#token_prefix'>%token_prefix</a></tt>
703<li><tt><a href='#token_type'>%token_type</a></tt>
704<li><tt><a href='#ptype'>%type</a></tt>
705<li><tt><a href='#pwildcard'>%wildcard</a></tt>
drh75897232000-05-29 14:26:00 +0000706</ul>
drh7b852412020-08-28 13:10:00 +0000707<p>Each of these directives will be described separately in the
drh75897232000-05-29 14:26:00 +0000708following sections:</p>
709
drh7b852412020-08-28 13:10:00 +0000710<a id='pcode'></a>
drh60c71b02020-09-01 11:20:03 +0000711<h4>4.4.1 The <tt>%code</tt> directive</h4>
drhf2340fc2001-06-08 00:25:18 +0000712
drh9a243e62017-09-20 09:09:34 +0000713<p>The <tt>%code</tt> directive is used to specify additional C code that
drhf2340fc2001-06-08 00:25:18 +0000714is added to the end of the main output file. This is similar to
drh9a243e62017-09-20 09:09:34 +0000715the <tt><a href='#pinclude'>%include</a></tt> directive except that
716<tt>%include</tt> is inserted at the beginning of the main output file.</p>
drhf2340fc2001-06-08 00:25:18 +0000717
drh9a243e62017-09-20 09:09:34 +0000718<p><tt>%code</tt> is typically used to include some action routines or perhaps
719a tokenizer or even the "main()" function
drh9bccde32016-03-19 18:00:44 +0000720as part of the output file.</p>
drhf2340fc2001-06-08 00:25:18 +0000721
drh60c71b02020-09-01 11:20:03 +0000722<p>There can be multiple <tt>%code</tt> directives. The arguments of
723all <tt>%code</tt> directives are concatenated.</p>
724
drh7b852412020-08-28 13:10:00 +0000725<a id='default_destructor'></a>
drh60c71b02020-09-01 11:20:03 +0000726<h4>4.4.2 The <tt>%default_destructor</tt> directive</h4>
drhf2340fc2001-06-08 00:25:18 +0000727
drh9a243e62017-09-20 09:09:34 +0000728<p>The <tt>%default_destructor</tt> directive specifies a destructor to
drhf2340fc2001-06-08 00:25:18 +0000729use for non-terminals that do not have their own destructor
drh9a243e62017-09-20 09:09:34 +0000730specified by a separate <tt>%destructor</tt> directive. See the documentation
drh7b852412020-08-28 13:10:00 +0000731on the <tt><a href='#destructor'>%destructor</a></tt> directive below for
drh9bccde32016-03-19 18:00:44 +0000732additional information.</p>
drhf2340fc2001-06-08 00:25:18 +0000733
drh9a243e62017-09-20 09:09:34 +0000734<p>In some grammars, many different non-terminal symbols have the
735same data type and hence the same destructor. This directive is
736a convenient way to specify the same destructor for all those
drhf2340fc2001-06-08 00:25:18 +0000737non-terminals using a single statement.</p>
738
drh7b852412020-08-28 13:10:00 +0000739<a id='default_type'></a>
drh60c71b02020-09-01 11:20:03 +0000740<h4>4.4.3 The <tt>%default_type</tt> directive</h4>
drhf2340fc2001-06-08 00:25:18 +0000741
drh9a243e62017-09-20 09:09:34 +0000742<p>The <tt>%default_type</tt> directive specifies the data type of non-terminal
743symbols that do not have their own data type defined using a separate
744<tt><a href='#ptype'>%type</a></tt> directive.</p>
drhf2340fc2001-06-08 00:25:18 +0000745
drh7b852412020-08-28 13:10:00 +0000746<a id='destructor'></a>
drh60c71b02020-09-01 11:20:03 +0000747<h4>4.4.4 The <tt>%destructor</tt> directive</h4>
drh75897232000-05-29 14:26:00 +0000748
drh9a243e62017-09-20 09:09:34 +0000749<p>The <tt>%destructor</tt> directive is used to specify a destructor for
drh75897232000-05-29 14:26:00 +0000750a non-terminal symbol.
drh9a243e62017-09-20 09:09:34 +0000751(See also the <tt><a href='#token_destructor'>%token_destructor</a></tt>
drh9bccde32016-03-19 18:00:44 +0000752directive which is used to specify a destructor for terminal symbols.)</p>
drh75897232000-05-29 14:26:00 +0000753
754<p>A non-terminal's destructor is called to dispose of the
755non-terminal's value whenever the non-terminal is popped from
drh7b852412020-08-28 13:10:00 +0000756the stack. This includes all of the following circumstances:</p>
drh75897232000-05-29 14:26:00 +0000757<ul>
758<li> When a rule reduces and the value of a non-terminal on
759 the right-hand side is not linked to C code.
760<li> When the stack is popped during error processing.
761<li> When the ParseFree() function runs.
762</ul>
drh7b852412020-08-28 13:10:00 +0000763<p>The destructor can do whatever it wants with the value of
drh75897232000-05-29 14:26:00 +0000764the non-terminal, but its design is to deallocate memory
765or other resources held by that non-terminal.</p>
766
drh7b852412020-08-28 13:10:00 +0000767<p>Consider an example:</p>
drh75897232000-05-29 14:26:00 +0000768<pre>
769 %type nt {void*}
770 %destructor nt { free($$); }
771 nt(A) ::= ID NUM. { A = malloc( 100 ); }
772</pre>
drh7b852412020-08-28 13:10:00 +0000773<p>This example is a bit contrived, but it serves to illustrate how
drh75897232000-05-29 14:26:00 +0000774destructors work. The example shows a non-terminal named
drh9bccde32016-03-19 18:00:44 +0000775"nt" that holds values of type "void*". When the rule for
776an "nt" reduces, it sets the value of the non-terminal to
drh75897232000-05-29 14:26:00 +0000777space obtained from malloc(). Later, when the nt non-terminal
778is popped from the stack, the destructor will fire and call
779free() on this malloced space, thus avoiding a memory leak.
drh9bccde32016-03-19 18:00:44 +0000780(Note that the symbol "$$" in the destructor code is replaced
drh75897232000-05-29 14:26:00 +0000781by the value of the non-terminal.)</p>
782
783<p>It is important to note that the value of a non-terminal is passed
784to the destructor whenever the non-terminal is removed from the
785stack, unless the non-terminal is used in a C-code action. If
786the non-terminal is used by C-code, then it is assumed that the
drh9bccde32016-03-19 18:00:44 +0000787C-code will take care of destroying it.
788More commonly, the value is used to build some
drh9a243e62017-09-20 09:09:34 +0000789larger structure, and we don't want to destroy it, which is why
drh75897232000-05-29 14:26:00 +0000790the destructor is not called in this circumstance.</p>
791
drh9bccde32016-03-19 18:00:44 +0000792<p>Destructors help avoid memory leaks by automatically freeing
793allocated objects when they go out of scope.
drh75897232000-05-29 14:26:00 +0000794To do the same using yacc or bison is much more difficult.</p>
795
drh7b852412020-08-28 13:10:00 +0000796<a id='extraarg'></a>
drh60c71b02020-09-01 11:20:03 +0000797<h4>4.4.5 The <tt>%extra_argument</tt> directive</h4>
drh75897232000-05-29 14:26:00 +0000798
drh7b852412020-08-28 13:10:00 +0000799<p>The <tt>%extra_argument</tt> directive instructs Lemon to add a 4th parameter
drh75897232000-05-29 14:26:00 +0000800to the parameter list of the Parse() function it generates. Lemon
801doesn't do anything itself with this extra argument, but it does
802make the argument available to C-code action routines, destructors,
803and so forth. For example, if the grammar file contains:</p>
804
drh7b852412020-08-28 13:10:00 +0000805<pre>
drh75897232000-05-29 14:26:00 +0000806 %extra_argument { MyStruct *pAbc }
drh7b852412020-08-28 13:10:00 +0000807</pre>
drh75897232000-05-29 14:26:00 +0000808
809<p>Then the Parse() function generated will have an 4th parameter
drh9bccde32016-03-19 18:00:44 +0000810of type "MyStruct*" and all action routines will have access to
811a variable named "pAbc" that is the value of the 4th parameter
drh75897232000-05-29 14:26:00 +0000812in the most recent call to Parse().</p>
813
drhfb32c442018-04-21 13:51:42 +0000814<p>The <tt>%extra_context</tt> directive works the same except that it
815is passed in on the ParseAlloc() or ParseInit() routines instead of
drh7b852412020-08-28 13:10:00 +0000816on Parse().</p>
drhfb32c442018-04-21 13:51:42 +0000817
drh7b852412020-08-28 13:10:00 +0000818<a id='extractx'></a>
drh60c71b02020-09-01 11:20:03 +0000819<h4>4.4.6 The <tt>%extra_context</tt> directive</h4>
drhfb32c442018-04-21 13:51:42 +0000820
drh7b852412020-08-28 13:10:00 +0000821<p>The <tt>%extra_context</tt> directive instructs Lemon to add a 2nd parameter
822to the parameter list of the ParseAlloc() and ParseInit() functions. Lemon
drhfb32c442018-04-21 13:51:42 +0000823doesn't do anything itself with these extra argument, but it does
824store the value make it available to C-code action routines, destructors,
825and so forth. For example, if the grammar file contains:</p>
826
drh7b852412020-08-28 13:10:00 +0000827<pre>
drhfb32c442018-04-21 13:51:42 +0000828 %extra_context { MyStruct *pAbc }
drh7b852412020-08-28 13:10:00 +0000829</pre>
drhfb32c442018-04-21 13:51:42 +0000830
drhed5e6682020-03-09 01:02:45 +0000831<p>Then the ParseAlloc() and ParseInit() functions will have an 2nd parameter
drhfb32c442018-04-21 13:51:42 +0000832of type "MyStruct*" and all action routines will have access to
drhed5e6682020-03-09 01:02:45 +0000833a variable named "pAbc" that is the value of that 2nd parameter.</p>
drhfb32c442018-04-21 13:51:42 +0000834
835<p>The <tt>%extra_argument</tt> directive works the same except that it
drh7b852412020-08-28 13:10:00 +0000836is passed in on the Parse() routine instead of on ParseAlloc()/ParseInit().</p>
drhfb32c442018-04-21 13:51:42 +0000837
drh7b852412020-08-28 13:10:00 +0000838<a id='pfallback'></a>
drh60c71b02020-09-01 11:20:03 +0000839<h4>4.4.7 The <tt>%fallback</tt> directive</h4>
drh9bccde32016-03-19 18:00:44 +0000840
drh9a243e62017-09-20 09:09:34 +0000841<p>The <tt>%fallback</tt> directive specifies an alternative meaning for one
drh9bccde32016-03-19 18:00:44 +0000842or more tokens. The alternative meaning is tried if the original token
drh9a243e62017-09-20 09:09:34 +0000843would have generated a syntax error.</p>
drh9bccde32016-03-19 18:00:44 +0000844
drh9a243e62017-09-20 09:09:34 +0000845<p>The <tt>%fallback</tt> directive was added to support robust parsing of SQL
846syntax in <a href='https://www.sqlite.org/'>SQLite</a>.
drh9bccde32016-03-19 18:00:44 +0000847The SQL language contains a large assortment of keywords, each of which
848appears as a different token to the language parser. SQL contains so
drh9a243e62017-09-20 09:09:34 +0000849many keywords that it can be difficult for programmers to keep up with
drh9bccde32016-03-19 18:00:44 +0000850them all. Programmers will, therefore, sometimes mistakenly use an
drh9a243e62017-09-20 09:09:34 +0000851obscure language keyword for an identifier. The <tt>%fallback</tt> directive
drh9bccde32016-03-19 18:00:44 +0000852provides a mechanism to tell the parser: "If you are unable to parse
drh9a243e62017-09-20 09:09:34 +0000853this keyword, try treating it as an identifier instead."</p>
drh9bccde32016-03-19 18:00:44 +0000854
drh7b852412020-08-28 13:10:00 +0000855<p>The syntax of <tt>%fallback</tt> is as follows:</p>
drh9bccde32016-03-19 18:00:44 +0000856
857<blockquote>
drh9a243e62017-09-20 09:09:34 +0000858<tt>%fallback</tt> <i>ID</i> <i>TOKEN...</i> <b>.</b>
859</blockquote></p>
drh9bccde32016-03-19 18:00:44 +0000860
drh9a243e62017-09-20 09:09:34 +0000861<p>In words, the <tt>%fallback</tt> directive is followed by a list of token
862names terminated by a period.
863The first token name is the fallback token &mdash; the
drh9bccde32016-03-19 18:00:44 +0000864token to which all the other tokens fall back to. The second and subsequent
865arguments are tokens which fall back to the token identified by the first
drh9a243e62017-09-20 09:09:34 +0000866argument.</p>
drh9bccde32016-03-19 18:00:44 +0000867
drh7b852412020-08-28 13:10:00 +0000868<a id='pifdef'></a>
drh60c71b02020-09-01 11:20:03 +0000869<h4>4.4.8 The <tt>%if</tt> directive and its friends</h4>
drh9bccde32016-03-19 18:00:44 +0000870
drh5f0d37b2020-07-03 18:07:22 +0000871<p>The <tt>%if</tt>, <tt>%ifdef</tt>, <tt>%ifndef</tt>, <tt>%else</tt>,
872and <tt>%endif</tt> directives
873are similar to #if, #ifdef, #ifndef, #else, and #endif in the C-preprocessor,
drh9a243e62017-09-20 09:09:34 +0000874just not as general.
drh9bccde32016-03-19 18:00:44 +0000875Each of these directives must begin at the left margin. No whitespace
drh9a243e62017-09-20 09:09:34 +0000876is allowed between the "%" and the directive name.</p>
drh9bccde32016-03-19 18:00:44 +0000877
drh9a243e62017-09-20 09:09:34 +0000878<p>Grammar text in between "<tt>%ifdef MACRO</tt>" and the next nested
879"<tt>%endif</tt>" is
drh9bccde32016-03-19 18:00:44 +0000880ignored unless the "-DMACRO" command-line option is used. Grammar text
drh9a243e62017-09-20 09:09:34 +0000881betwen "<tt>%ifndef MACRO</tt>" and the next nested "<tt>%endif</tt>" is
drh5f0d37b2020-07-03 18:07:22 +0000882included except when the "-DMACRO" command-line option is used.<p>
drh9bccde32016-03-19 18:00:44 +0000883
drh5f0d37b2020-07-03 18:07:22 +0000884<p>The text in between "<tt>%if</tt> <i>CONDITIONAL</i>" and its
885corresponding <tt>%endif</tt> is included only if <i>CONDITIONAL</i>
886is true. The CONDITION is one or more macro names, optionally connected
887using the "||" and "&amp;&amp;" binary operators, the "!" unary operator,
888and grouped using balanced parentheses. Each term is true if the
889corresponding macro exists, and false if it does not exist.</p>
drh9bccde32016-03-19 18:00:44 +0000890
drh5f0d37b2020-07-03 18:07:22 +0000891<p>An optional "<tt>%else</tt>" directive can occur anywhere in between a
892<tt>%ifdef</tt>, <tt>%ifndef</tt>, or <tt>%if</tt> directive and
893its corresponding <tt>%endif</tt>.</p>
894
895<p>Note that the argument to <tt>%ifdef</tt> and <tt>%ifndef</tt> is
896intended to be a single preprocessor symbol name, not a general expression.
897Use the "<tt>%if</tt>" directive for general expressions.</p>
drh9bccde32016-03-19 18:00:44 +0000898
drh7b852412020-08-28 13:10:00 +0000899<a id='pinclude'></a>
drh60c71b02020-09-01 11:20:03 +0000900<h4>4.4.9 The <tt>%include</tt> directive</h4>
drh75897232000-05-29 14:26:00 +0000901
drh9a243e62017-09-20 09:09:34 +0000902<p>The <tt>%include</tt> directive specifies C code that is included at the
903top of the generated parser. You can include any text you want &mdash;
drhf2340fc2001-06-08 00:25:18 +0000904the Lemon parser generator copies it blindly. If you have multiple
drh9a243e62017-09-20 09:09:34 +0000905<tt>%include</tt> directives in your grammar file, their values are concatenated
906so that all <tt>%include</tt> code ultimately appears near the top of the
907generated parser, in the same order as it appeared in the grammar.</p>
drh75897232000-05-29 14:26:00 +0000908
drh9a243e62017-09-20 09:09:34 +0000909<p>The <tt>%include</tt> directive is very handy for getting some extra #include
drh75897232000-05-29 14:26:00 +0000910preprocessor statements at the beginning of the generated parser.
911For example:</p>
912
drh7b852412020-08-28 13:10:00 +0000913<pre>
drh75897232000-05-29 14:26:00 +0000914 %include {#include &lt;unistd.h&gt;}
drh7b852412020-08-28 13:10:00 +0000915</pre>
drh75897232000-05-29 14:26:00 +0000916
917<p>This might be needed, for example, if some of the C actions in the
drh9a243e62017-09-20 09:09:34 +0000918grammar call functions that are prototyped in unistd.h.</p>
drh75897232000-05-29 14:26:00 +0000919
drh60ce5d32018-11-27 14:34:33 +0000920<p>Use the <tt><a href="#pcode">%code</a></tt> directive to add code to
921the end of the generated parser.</p>
922
drh7b852412020-08-28 13:10:00 +0000923<a id='pleft'></a>
drh60c71b02020-09-01 11:20:03 +0000924<h4>4.4.10 The <tt>%left</tt> directive</h4>
drh75897232000-05-29 14:26:00 +0000925
drh9a243e62017-09-20 09:09:34 +0000926The <tt>%left</tt> directive is used (along with the
927<tt><a href='#pright'>%right</a></tt> and
928<tt><a href='#pnonassoc'>%nonassoc</a></tt> directives) to declare
929precedences of terminal symbols.
930Every terminal symbol whose name appears after
931a <tt>%left</tt> directive but before the next period (".") is
drh75897232000-05-29 14:26:00 +0000932given the same left-associative precedence value. Subsequent
drh9a243e62017-09-20 09:09:34 +0000933<tt>%left</tt> directives have higher precedence. For example:</p>
drh75897232000-05-29 14:26:00 +0000934
drh7b852412020-08-28 13:10:00 +0000935<pre>
drh75897232000-05-29 14:26:00 +0000936 %left AND.
937 %left OR.
938 %nonassoc EQ NE GT GE LT LE.
939 %left PLUS MINUS.
940 %left TIMES DIVIDE MOD.
941 %right EXP NOT.
drh7b852412020-08-28 13:10:00 +0000942</pre>
drh75897232000-05-29 14:26:00 +0000943
drh9a243e62017-09-20 09:09:34 +0000944<p>Note the period that terminates each <tt>%left</tt>,
945<tt>%right</tt> or <tt>%nonassoc</tt>
drh75897232000-05-29 14:26:00 +0000946directive.</p>
947
948<p>LALR(1) grammars can get into a situation where they require
949a large amount of stack space if you make heavy use or right-associative
drh9a243e62017-09-20 09:09:34 +0000950operators. For this reason, it is recommended that you use <tt>%left</tt>
951rather than <tt>%right</tt> whenever possible.</p>
drh75897232000-05-29 14:26:00 +0000952
drh7b852412020-08-28 13:10:00 +0000953<a id='pname'></a>
drh60c71b02020-09-01 11:20:03 +0000954<h4>4.4.11 The <tt>%name</tt> directive</h4>
drh75897232000-05-29 14:26:00 +0000955
956<p>By default, the functions generated by Lemon all begin with the
drh9bccde32016-03-19 18:00:44 +0000957five-character string "Parse". You can change this string to something
drh9a243e62017-09-20 09:09:34 +0000958different using the <tt>%name</tt> directive. For instance:</p>
drh75897232000-05-29 14:26:00 +0000959
drh7b852412020-08-28 13:10:00 +0000960<pre>
drh75897232000-05-29 14:26:00 +0000961 %name Abcde
drh7b852412020-08-28 13:10:00 +0000962</pre>
drh75897232000-05-29 14:26:00 +0000963
964<p>Putting this directive in the grammar file will cause Lemon to generate
drh7b852412020-08-28 13:10:00 +0000965functions named</p>
drh75897232000-05-29 14:26:00 +0000966<ul>
967<li> AbcdeAlloc(),
968<li> AbcdeFree(),
969<li> AbcdeTrace(), and
970<li> Abcde().
971</ul>
drh7b852412020-08-28 13:10:00 +0000972</p>The <tt>%name</tt> directive allows you to generate two or more different
drh9a243e62017-09-20 09:09:34 +0000973parsers and link them all into the same executable.</p>
drh75897232000-05-29 14:26:00 +0000974
drh7b852412020-08-28 13:10:00 +0000975<a id='pnonassoc'></a>
drh60c71b02020-09-01 11:20:03 +0000976<h4>4.4.12 The <tt>%nonassoc</tt> directive</h4>
drh75897232000-05-29 14:26:00 +0000977
978<p>This directive is used to assign non-associative precedence to
drh9a243e62017-09-20 09:09:34 +0000979one or more terminal symbols. See the section on
drh9bccde32016-03-19 18:00:44 +0000980<a href='#precrules'>precedence rules</a>
drh9a243e62017-09-20 09:09:34 +0000981or on the <tt><a href='#pleft'>%left</a></tt> directive
982for additional information.</p>
drh75897232000-05-29 14:26:00 +0000983
drh7b852412020-08-28 13:10:00 +0000984<a id='parse_accept'></a>
drh60c71b02020-09-01 11:20:03 +0000985<h4>4.4.13 The <tt>%parse_accept</tt> directive</h4>
drh75897232000-05-29 14:26:00 +0000986
drh9a243e62017-09-20 09:09:34 +0000987<p>The <tt>%parse_accept</tt> directive specifies a block of C code that is
drh9bccde32016-03-19 18:00:44 +0000988executed whenever the parser accepts its input string. To "accept"
drh75897232000-05-29 14:26:00 +0000989an input string means that the parser was able to process all tokens
990without error.</p>
991
992<p>For example:</p>
993
drh7b852412020-08-28 13:10:00 +0000994<pre>
drh75897232000-05-29 14:26:00 +0000995 %parse_accept {
996 printf("parsing complete!\n");
997 }
drh7b852412020-08-28 13:10:00 +0000998</pre>
drh75897232000-05-29 14:26:00 +0000999
drh7b852412020-08-28 13:10:00 +00001000<a id='parse_failure'></a>
drh60c71b02020-09-01 11:20:03 +00001001<h4>4.4.14 The <tt>%parse_failure</tt> directive</h4>
drh75897232000-05-29 14:26:00 +00001002
drh9a243e62017-09-20 09:09:34 +00001003<p>The <tt>%parse_failure</tt> directive specifies a block of C code that
drh75897232000-05-29 14:26:00 +00001004is executed whenever the parser fails complete. This code is not
1005executed until the parser has tried and failed to resolve an input
1006error using is usual error recovery strategy. The routine is
1007only invoked when parsing is unable to continue.</p>
1008
drh7b852412020-08-28 13:10:00 +00001009<pre>
drh75897232000-05-29 14:26:00 +00001010 %parse_failure {
1011 fprintf(stderr,"Giving up. Parser is hopelessly lost...\n");
1012 }
drh7b852412020-08-28 13:10:00 +00001013</pre>
drh75897232000-05-29 14:26:00 +00001014
drh7b852412020-08-28 13:10:00 +00001015<a id='pright'></a>
drh60c71b02020-09-01 11:20:03 +00001016<h4>4.4.15 The <tt>%right</tt> directive</h4>
drh75897232000-05-29 14:26:00 +00001017
1018<p>This directive is used to assign right-associative precedence to
drh9a243e62017-09-20 09:09:34 +00001019one or more terminal symbols. See the section on
drh9bccde32016-03-19 18:00:44 +00001020<a href='#precrules'>precedence rules</a>
1021or on the <a href='#pleft'>%left</a> directive for additional information.</p>
drh75897232000-05-29 14:26:00 +00001022
drh7b852412020-08-28 13:10:00 +00001023<a id='stack_overflow'></a>
drh60c71b02020-09-01 11:20:03 +00001024<h4>4.4.16 The <tt>%stack_overflow</tt> directive</h4>
drh75897232000-05-29 14:26:00 +00001025
drh9a243e62017-09-20 09:09:34 +00001026<p>The <tt>%stack_overflow</tt> directive specifies a block of C code that
drh75897232000-05-29 14:26:00 +00001027is executed if the parser's internal stack ever overflows. Typically
1028this just prints an error message. After a stack overflow, the parser
1029will be unable to continue and must be reset.</p>
1030
drh7b852412020-08-28 13:10:00 +00001031<pre>
drh75897232000-05-29 14:26:00 +00001032 %stack_overflow {
1033 fprintf(stderr,"Giving up. Parser stack overflow\n");
1034 }
drh7b852412020-08-28 13:10:00 +00001035</pre>
drh75897232000-05-29 14:26:00 +00001036
1037<p>You can help prevent parser stack overflows by avoiding the use
1038of right recursion and right-precedence operators in your grammar.
drh9a243e62017-09-20 09:09:34 +00001039Use left recursion and and left-precedence operators instead to
drh75897232000-05-29 14:26:00 +00001040encourage rules to reduce sooner and keep the stack size down.
drh7b852412020-08-28 13:10:00 +00001041For example, do rules like this:</p>
drh75897232000-05-29 14:26:00 +00001042<pre>
1043 list ::= list element. // left-recursion. Good!
1044 list ::= .
1045</pre>
drh7b852412020-08-28 13:10:00 +00001046<p>Not like this:</p>
drh75897232000-05-29 14:26:00 +00001047<pre>
1048 list ::= element list. // right-recursion. Bad!
1049 list ::= .
drh7b852412020-08-28 13:10:00 +00001050</pre>
drh75897232000-05-29 14:26:00 +00001051
drh7b852412020-08-28 13:10:00 +00001052<a id='stack_size'></a>
drh60c71b02020-09-01 11:20:03 +00001053<h4>4.4.17 The <tt>%stack_size</tt> directive</h4>
drh75897232000-05-29 14:26:00 +00001054
1055<p>If stack overflow is a problem and you can't resolve the trouble
1056by using left-recursion, then you might want to increase the size
1057of the parser's stack using this directive. Put an positive integer
drh9a243e62017-09-20 09:09:34 +00001058after the <tt>%stack_size</tt> directive and Lemon will generate a parse
drh75897232000-05-29 14:26:00 +00001059with a stack of the requested size. The default value is 100.</p>
1060
drh7b852412020-08-28 13:10:00 +00001061<pre>
drh75897232000-05-29 14:26:00 +00001062 %stack_size 2000
drh7b852412020-08-28 13:10:00 +00001063</pre>
drh75897232000-05-29 14:26:00 +00001064
drh7b852412020-08-28 13:10:00 +00001065<a id='start_symbol'></a>
drh60c71b02020-09-01 11:20:03 +00001066<h4>4.4.18 The <tt>%start_symbol</tt> directive</h4>
drh75897232000-05-29 14:26:00 +00001067
drh9a243e62017-09-20 09:09:34 +00001068<p>By default, the start symbol for the grammar that Lemon generates
drh75897232000-05-29 14:26:00 +00001069is the first non-terminal that appears in the grammar file. But you
drh9a243e62017-09-20 09:09:34 +00001070can choose a different start symbol using the
1071<tt>%start_symbol</tt> directive.</p>
drh75897232000-05-29 14:26:00 +00001072
drh7b852412020-08-28 13:10:00 +00001073<pre>
drh75897232000-05-29 14:26:00 +00001074 %start_symbol prog
drh7b852412020-08-28 13:10:00 +00001075</pre>
drh75897232000-05-29 14:26:00 +00001076
drh7b852412020-08-28 13:10:00 +00001077<a id='syntax_error'></a>
drh60c71b02020-09-01 11:20:03 +00001078<h4>4.4.19 The <tt>%syntax_error</tt> directive</h4>
drh9a243e62017-09-20 09:09:34 +00001079
1080<p>See <a href='#error_processing'>Error Processing</a>.</p>
1081
drh7b852412020-08-28 13:10:00 +00001082<a id='token_class'></a>
drh60c71b02020-09-01 11:20:03 +00001083<h4>4.4.20 The <tt>%token_class</tt> directive</h4>
drh9a243e62017-09-20 09:09:34 +00001084
1085<p>Undocumented. Appears to be related to the MULTITERMINAL concept.
1086<a href='http://sqlite.org/src/fdiff?v1=796930d5fc2036c7&v2=624b24c5dc048e09&sbs=0'>Implementation</a>.</p>
1087
drh7b852412020-08-28 13:10:00 +00001088<a id='token_destructor'></a>
drh60c71b02020-09-01 11:20:03 +00001089<h4>4.4.21 The <tt>%token_destructor</tt> directive</h4>
drh75897232000-05-29 14:26:00 +00001090
drh9a243e62017-09-20 09:09:34 +00001091<p>The <tt>%destructor</tt> directive assigns a destructor to a non-terminal
1092symbol. (See the description of the
1093<tt><a href='%destructor'>%destructor</a></tt> directive above.)
1094The <tt>%token_destructor</tt> directive does the same thing
1095for all terminal symbols.</p>
drh75897232000-05-29 14:26:00 +00001096
drh7b852412020-08-28 13:10:00 +00001097<p>Unlike non-terminal symbols, which may each have a different data type
drh75897232000-05-29 14:26:00 +00001098for their values, terminals all use the same data type (defined by
drh9a243e62017-09-20 09:09:34 +00001099the <tt><a href='#token_type'>%token_type</a></tt> directive)
1100and so they use a common destructor.
1101Other than that, the token destructor works just like the non-terminal
drh75897232000-05-29 14:26:00 +00001102destructors.</p>
1103
drh7b852412020-08-28 13:10:00 +00001104<a id='token_prefix'></a>
drh60c71b02020-09-01 11:20:03 +00001105<h4>4.4.22 The <tt>%token_prefix</tt> directive</h4>
drh75897232000-05-29 14:26:00 +00001106
1107<p>Lemon generates #defines that assign small integer constants
1108to each terminal symbol in the grammar. If desired, Lemon will
1109add a prefix specified by this directive
drh9a243e62017-09-20 09:09:34 +00001110to each of the #defines it generates.</p>
1111
drh7b852412020-08-28 13:10:00 +00001112<p>So if the default output of Lemon looked like this:</p>
drh75897232000-05-29 14:26:00 +00001113<pre>
1114 #define AND 1
1115 #define MINUS 2
1116 #define OR 3
1117 #define PLUS 4
1118</pre>
drh7b852412020-08-28 13:10:00 +00001119<p>You can insert a statement into the grammar like this:</p>
drh75897232000-05-29 14:26:00 +00001120<pre>
1121 %token_prefix TOKEN_
1122</pre>
drh7b852412020-08-28 13:10:00 +00001123<p>to cause Lemon to produce these symbols instead:</p>
drh75897232000-05-29 14:26:00 +00001124<pre>
1125 #define TOKEN_AND 1
1126 #define TOKEN_MINUS 2
1127 #define TOKEN_OR 3
1128 #define TOKEN_PLUS 4
drh7b852412020-08-28 13:10:00 +00001129</pre>
drh75897232000-05-29 14:26:00 +00001130
drh7b852412020-08-28 13:10:00 +00001131<a id='token_type'></a><a id='ptype'></a>
drh60c71b02020-09-01 11:20:03 +00001132<h4>4.4.23 The <tt>%token_type</tt> and <tt>%type</tt> directives</h4>
drh75897232000-05-29 14:26:00 +00001133
1134<p>These directives are used to specify the data types for values
1135on the parser's stack associated with terminal and non-terminal
1136symbols. The values of all terminal symbols must be of the same
1137type. This turns out to be the same data type as the 3rd parameter
1138to the Parse() function generated by Lemon. Typically, you will
drhed5e6682020-03-09 01:02:45 +00001139make the value of a terminal symbol be a pointer to some kind of
drh75897232000-05-29 14:26:00 +00001140token structure. Like this:</p>
1141
drh7b852412020-08-28 13:10:00 +00001142<pre>
drh75897232000-05-29 14:26:00 +00001143 %token_type {Token*}
drh7b852412020-08-28 13:10:00 +00001144</pre>
drh75897232000-05-29 14:26:00 +00001145
1146<p>If the data type of terminals is not specified, the default value
drhdfe4e6b2016-10-08 13:34:08 +00001147is "void*".</p>
drh75897232000-05-29 14:26:00 +00001148
1149<p>Non-terminal symbols can each have their own data types. Typically
drh9a243e62017-09-20 09:09:34 +00001150the data type of a non-terminal is a pointer to the root of a parse tree
drh75897232000-05-29 14:26:00 +00001151structure that contains all information about that non-terminal.
1152For example:</p>
1153
drh7b852412020-08-28 13:10:00 +00001154<pre>
drh75897232000-05-29 14:26:00 +00001155 %type expr {Expr*}
drh7b852412020-08-28 13:10:00 +00001156</pre>
drh75897232000-05-29 14:26:00 +00001157
1158<p>Each entry on the parser's stack is actually a union containing
1159instances of all data types for every non-terminal and terminal symbol.
1160Lemon will automatically use the correct element of this union depending
1161on what the corresponding non-terminal or terminal symbol is. But
1162the grammar designer should keep in mind that the size of the union
1163will be the size of its largest element. So if you have a single
1164non-terminal whose data type requires 1K of storage, then your 100
1165entry parser stack will require 100K of heap space. If you are willing
1166and able to pay that price, fine. You just need to know.</p>
1167
drh7b852412020-08-28 13:10:00 +00001168<a id='pwildcard'></a>
drh60c71b02020-09-01 11:20:03 +00001169<h4>4.4.24 The <tt>%wildcard</tt> directive</h4>
drh9bccde32016-03-19 18:00:44 +00001170
drh9a243e62017-09-20 09:09:34 +00001171<p>The <tt>%wildcard</tt> directive is followed by a single token name and a
1172period. This directive specifies that the identified token should
1173match any input token.</p>
drh9bccde32016-03-19 18:00:44 +00001174
1175<p>When the generated parser has the choice of matching an input against
1176the wildcard token and some other token, the other token is always used.
drh9a243e62017-09-20 09:09:34 +00001177The wildcard token is only matched if there are no alternatives.</p>
drh9bccde32016-03-19 18:00:44 +00001178
drh7b852412020-08-28 13:10:00 +00001179<a id='error_processing'></a>
drh60c71b02020-09-01 11:20:03 +00001180<h2>5.0 Error Processing</h2>
drh75897232000-05-29 14:26:00 +00001181
1182<p>After extensive experimentation over several years, it has been
1183discovered that the error recovery strategy used by yacc is about
1184as good as it gets. And so that is what Lemon uses.</p>
1185
1186<p>When a Lemon-generated parser encounters a syntax error, it
drh9a243e62017-09-20 09:09:34 +00001187first invokes the code specified by the <tt>%syntax_error</tt> directive, if
drh75897232000-05-29 14:26:00 +00001188any. It then enters its error recovery strategy. The error recovery
1189strategy is to begin popping the parsers stack until it enters a
1190state where it is permitted to shift a special non-terminal symbol
drh9bccde32016-03-19 18:00:44 +00001191named "error". It then shifts this non-terminal and continues
drh9a243e62017-09-20 09:09:34 +00001192parsing. The <tt>%syntax_error</tt> routine will not be called again
drh75897232000-05-29 14:26:00 +00001193until at least three new tokens have been successfully shifted.</p>
1194
1195<p>If the parser pops its stack until the stack is empty, and it still
drh9a243e62017-09-20 09:09:34 +00001196is unable to shift the error symbol, then the
1197<tt><a href='#parse_failure'>%parse_failure</a></tt> routine
drh75897232000-05-29 14:26:00 +00001198is invoked and the parser resets itself to its start state, ready
1199to begin parsing a new file. This is what will happen at the very
drh9a243e62017-09-20 09:09:34 +00001200first syntax error, of course, if there are no instances of the
drh9bccde32016-03-19 18:00:44 +00001201"error" non-terminal in your grammar.</p>
drh75897232000-05-29 14:26:00 +00001202
drh60c71b02020-09-01 11:20:03 +00001203<a id='history'></a>
1204<h2>6.0 History of Lemon</h2>
1205
1206<p>Lemon was originally written by Richard Hipp sometime in the late
12071980s on a Sun4 Workstation using K&amp;R C.
1208There was a companion LL(1) parser generator program named "Lime", the
1209source code to which as been lost.</p>
1210
1211<p>The lemon.c source file was originally many separate files that were
1212compiled together to generate the "lemon" executable. Sometime in the
12131990s, the individual source code files were combined together into
1214the current single large "lemon.c" source file. You can still see traces
1215of original filenames in the code.</p>
1216
1217<p>Since 2001, Lemon has been part of the
1218<a href="https://sqlite.org/">SQLite project</a> and the source code
1219to Lemon has been managed as a part of the
1220<a href="https://sqlite.org/src">SQLite source tree</a> in the following
1221files:</p>
1222
1223<ul>
1224<li> <a href="https://sqlite.org/src/file/tool/lemon.c">tool/lemon.c</a>
1225<li> <a href="https://sqlite.org/src/file/tool/lempar.c">tool/lempar.c</a>
1226<li> <a href="https://sqlite.org/src/file/doc/lemon.html">doc/lemon.html</a>
1227</ul>
1228
1229<a id="copyright"></a>
1230<h2>7.0 Copyright</h2>
1231
1232<p>All of the source code to Lemon, including the template parser file
1233"lempar.c" and this documentation file ("lemon.html") are in the public
1234domain. You can use the code for any purpose and without attribution.</p>
1235
1236<p>The code comes with no warranty. If it breaks, you get to keep both
1237pieces.</p>
1238
drh75897232000-05-29 14:26:00 +00001239</body>
1240</html>