Thanks to visit codestin.com
Credit goes to chromium.googlesource.com

blob: 965f305c04169d0209cdab229df162f6fc651c0b [file] [log] [blame]
drh75897232000-05-29 14:26:001<html>
2<head>
3<title>The Lemon Parser Generator</title>
4</head>
drh60c71b02020-09-01 11:20:035<body>
6<a id="main"></a>
drh9a243e62017-09-20 09:09:347<h1 align='center'>The Lemon Parser Generator</h1>
drh75897232000-05-29 14:26:008
drh9bccde32016-03-19 18:00:449<p>Lemon is an LALR(1) parser generator for C.
10It does the same job as "bison" and "yacc".
drh9a243e62017-09-20 09:09:3411But Lemon is not a bison or yacc clone. Lemon
drh75897232000-05-29 14:26:0012uses a different grammar syntax which is designed to
drh9bccde32016-03-19 18:00:4413reduce 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:3420to eliminate resource leaks, making it suitable for use
drh75897232000-05-29 14:26:0021in 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:0327<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:1958
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:0061safely process maliciously crafted inputs.</p>
drhc5e56b32017-06-01 01:53:1962
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:0377<a id="optheory"></a>
78<h2>3.0 Theory of Operation</h2>
drh75897232000-05-29 14:26:0079
drh60c71b02020-09-01 11:20:0380<p>Lemon is computer program that translates a context free grammar (CFG)
drh75897232000-05-29 14:26:0081for a particular language into C code that implements a parser for
82that language.
drh60c71b02020-09-01 11:20:0383The Lemon program has two inputs:</p>
drh75897232000-05-29 14:26:0084<ul>
85<li>The grammar specification.
86<li>A parser template file.
87</ul>
drh7b852412020-08-28 13:10:0088<p>Typically, only the grammar specification is supplied by the programmer.
drh60c71b02020-09-01 11:20:0389Lemon 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:0093
drh9a243e62017-09-20 09:09:3494<p>Depending on command-line options, Lemon will generate up to
drh7b852412020-08-28 13:10:0095three output files.</p>
drh75897232000-05-29 14:26:0096<ul>
drh60c71b02020-09-01 11:20:0397<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:00100<li>An information file that describes the states of the generated parser
101 automaton.
102</ul>
drh7b852412020-08-28 13:10:00103<p>By default, all three of these output files are generated.
drh9bccde32016-03-19 18:00:44104The 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:00106
drh9bccde32016-03-19 18:00:44107<p>The grammar specification file uses a ".y" suffix, by convention.
drh75897232000-05-29 14:26:00108In the examples used in this document, we'll assume the name of the
drh9bccde32016-03-19 18:00:44109grammar file is "gram.y". A typical use of Lemon would be the
drh7b852412020-08-28 13:10:00110following command:</p>
drh75897232000-05-29 14:26:00111<pre>
112 lemon gram.y
113</pre>
drh7b852412020-08-28 13:10:00114<p>This command will generate three output files named "gram.c",
drh9bccde32016-03-19 18:00:44115"gram.h" and "gram.out".
drh75897232000-05-29 14:26:00116The 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:03121<a id="options"></a>
122<h3>3.1 Command Line Options</h3>
drh75897232000-05-29 14:26:00123
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:00126with a brief explanation of what each does by typing</p>
drh75897232000-05-29 14:26:00127<pre>
drh9a243e62017-09-20 09:09:34128 lemon "-?"
drh75897232000-05-29 14:26:00129</pre>
drh7b852412020-08-28 13:10:00130<p>As of this writing, the following command-line options are supported:</p>
drh75897232000-05-29 14:26:00131<ul>
drh9bccde32016-03-19 18:00:44132<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:34135Do 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:42137<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:44140<li><b>-D<i>name</i></b>
drh9a243e62017-09-20 09:09:34141Define C preprocessor macro <i>name</i>. This macro is usable by
drh5f0d37b2020-07-03 18:07:22142"<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:34145in the grammar file.
drh5f0d37b2020-07-03 18:07:22146<li><b>-E</b>
147Run the "%if" preprocessor step only and print the revised grammar
148file.
drh9bccde32016-03-19 18:00:44149<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:08153Omit "#line" directives in the generated parser C code.
drh9bccde32016-03-19 18:00:44154<li><b>-m</b>
155Cause the output C source code to be compatible with the "makeheaders"
drh9a243e62017-09-20 09:09:34156program.
drh9bccde32016-03-19 18:00:44157<li><b>-p</b>
drh9a243e62017-09-20 09:09:34158Display all conflicts that are resolved by
drh9bccde32016-03-19 18:00:44159<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:45165Show parser statistics before exiting.
drh9bccde32016-03-19 18:00:44166<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:00170</ul>
drh75897232000-05-29 14:26:00171
drh60c71b02020-09-01 11:20:03172<a id="interface"></a>
173<h3>3.2 The Parser Interface</h3>
drh75897232000-05-29 14:26:00174
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:00183A new parser is created as follows:</p>
drh75897232000-05-29 14:26:00184<pre>
185 void *pParser = ParseAlloc( malloc );
186</pre>
drh7b852412020-08-28 13:10:00187<p>The ParseAlloc() routine allocates and initializes a new parser and
drh75897232000-05-29 14:26:00188returns a pointer to it.
drh9bccde32016-03-19 18:00:44189The actual data structure used to represent a parser is opaque &mdash;
drh75897232000-05-29 14:26:00190its 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:44194subroutine used to allocate memory. Typically this means malloc().</p>
drh75897232000-05-29 14:26:00195
196<p>After a program is finished using a parser, it can reclaim all
drh7b852412020-08-28 13:10:00197memory allocated by that parser by calling</p>
drh75897232000-05-29 14:26:00198<pre>
199 ParseFree(pParser, free);
200</pre>
drh7b852412020-08-28 13:10:00201<p>The first argument is the same pointer returned by ParseAlloc(). The
drh75897232000-05-29 14:26:00202second 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:00208once for each token:<p>
drh75897232000-05-29 14:26:00209<pre>
210 Parse(pParser, hTokenID, sTokenData, pArg);
211</pre>
drh7b852412020-08-28 13:10:00212<p>The first argument to the Parse() routine is the pointer returned by
drh75897232000-05-29 14:26:00213ParseAlloc().
drh9a243e62017-09-20 09:09:34214The second argument is a small positive integer that tells the parser the
drh75897232000-05-29 14:26:00215type 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:44219A 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:00221The third argument is the value of the given token. By default,
drh9a243e62017-09-20 09:09:34222the type of the third argument is "void*", but the grammar will
drh75897232000-05-29 14:26:00223usually 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:44225such as "identifier" or "number" and the third argument will
drh75897232000-05-29 14:26:00226be 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:49229depending on the grammar. If the grammar specification file requests
drh9a243e62017-09-20 09:09:34230it (via the <tt><a href='#extraarg'>%extra_argument</a></tt> directive),
drh45f31be2016-02-16 21:19:49231the Parse() function will have a fourth parameter that can be
drh75897232000-05-29 14:26:00232of 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:00238following:</p>
drh75897232000-05-29 14:26:00239<pre>
drh9a243e62017-09-20 09:09:34240 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:00252 13 }
drh9a243e62017-09-20 09:09:34253 14 Parse(pParser, 0, sToken, &amp;sState);
drh75897232000-05-29 14:26:00254 15 ParseFree(pParser, free );
255 16 TokenizerFree(pTokenizer);
256 17 return sState.treeRoot;
257 18 }
258</pre>
drh7b852412020-08-28 13:10:00259<p>This example shows a user-written routine that parses a file of
drh75897232000-05-29 14:26:00260text and returns a pointer to the parse tree.
drh9bccde32016-03-19 18:00:44261(All error-handling code is omitted from this example to keep it
drh75897232000-05-29 14:26:00262simple.)
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:34266next token from the input file and puts its type in the
drh75897232000-05-29 14:26:00267integer variable hTokenId. The sToken variable is assumed to be
268some kind of structure that contains details about each token,
drh9a243e62017-09-20 09:09:34269such as its complete text, what line it occurs on, etc.</p>
drh75897232000-05-29 14:26:00270
drh7b852412020-08-28 13:10:00271<p>This example also assumes the existence of a structure of type
drh75897232000-05-29 14:26:00272ParserState 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:00282<p>The core of this example as it relates to Lemon is as follows:</p>
drh75897232000-05-29 14:26:00283<pre>
284 ParseFile(){
285 pParser = ParseAlloc( malloc );
drh9a243e62017-09-20 09:09:34286 while( GetNextToken(pTokenizer,&amp;hTokenId, &amp;sToken) ){
drh75897232000-05-29 14:26:00287 Parse(pParser, hTokenId, sToken);
288 }
289 Parse(pParser, 0, sToken);
290 ParseFree(pParser, free );
291 }
292</pre>
drh7b852412020-08-28 13:10:00293<p>Basically, what a program has to do to use a Lemon-generated parser
drh75897232000-05-29 14:26:00294is 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:00304from the parser. A prototype for this routine is as follows:</p>
drh75897232000-05-29 14:26:00305<pre>
306 ParseTrace(FILE *stream, char *zPrefix);
307</pre>
drh7b852412020-08-28 13:10:00308<p>After this routine is called, a short (one-line) message is written
drh75897232000-05-29 14:26:00309to 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:03314<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()
drh61791c62023-05-12 12:45:56325<li> Pass a pointer to the variable in calls to Parse()
drh60c71b02020-09-01 11:20:03326<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:00369
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:00372bison and Lemon.</p>
drh75897232000-05-29 14:26:00373<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:00381<p>These differences may cause some initial confusion for programmers
drh75897232000-05-29 14:26:00382with 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:49386<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:03389tokenizer-calls-parser paradigm used by Lemon, eliminating the
drh45f31be2016-02-16 21:19:49390need for global variables.</p>
391
drh60c71b02020-09-01 11:20:03392<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:00422
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:00429<p>The grammar file for Lemon is, for the most part, a free format.
drh75897232000-05-29 14:26:00430It does not have sections or divisions like yacc or bison. Any
drh7b852412020-08-28 13:10:00431declaration 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:00434
drh60c71b02020-09-01 11:20:03435<a id="tnt"></a>
436<h3>4.1 Terminals and Nonterminals</h3>
drh75897232000-05-29 14:26:00437
438<p>A terminal symbol (token) is any string of alphanumeric
drh9bccde32016-03-19 18:00:44439and/or underscore characters
drh9a243e62017-09-20 09:09:34440that begins with an uppercase letter.
drhc8eee5e2011-07-30 23:50:12441A terminal can contain lowercase letters after the first character,
drh9a243e62017-09-20 09:09:34442but the usual convention is to make terminals all uppercase.
drh75897232000-05-29 14:26:00443A nonterminal, on the other hand, is any string of alphanumeric
drh9a243e62017-09-20 09:09:34444and 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:00447
drh9a243e62017-09-20 09:09:34448<p>In Lemon, terminal and nonterminal symbols do not need to
drh75897232000-05-29 14:26:00449be 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:03461<a id="rules"></a>
462<h3>4.2 Grammar Rules</h3>
drh75897232000-05-29 14:26:00463
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:44467the special symbol "::=" and then a list of terminals and/or nonterminals.
drh75897232000-05-29 14:26:00468The 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:34473specified otherwise using the <tt><a href='#start_symbol'>%start_symbol</a></tt>
474directive described below.)
drh7b852412020-08-28 13:10:00475A typical sequence of grammar rules might look something like this:</p>
drh75897232000-05-29 14:26:00476<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:00482
drh9bccde32016-03-19 18:00:44483<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:00486
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:00493For example:</p>
drh75897232000-05-29 14:26:00494<pre>
495 expr ::= expr PLUS expr. { printf("Doing an addition...\n"); }
496</pre>
drh75897232000-05-29 14:26:00497
498<p>In order to be useful, grammar actions must normally be linked to
499their associated grammar rules.
drh9bccde32016-03-19 18:00:44500In yacc and bison, this is accomplished by embedding a "$$" in the
drh75897232000-05-29 14:26:00501action to stand for the value of the left-hand side of the rule and
drh9bccde32016-03-19 18:00:44502symbols "$1", "$2", and so forth to stand for the value of
drh75897232000-05-29 14:26:00503the 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:44508rule and say "$7" when you really mean "$8".</p>
drh75897232000-05-29 14:26:00509
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:00513In yacc or bison, one would write this:</p>
drh75897232000-05-29 14:26:00514<pre>
drh9a243e62017-09-20 09:09:34515 expr -&gt; expr PLUS expr { $$ = $1 + $3; };
drh75897232000-05-29 14:26:00516</pre>
drh7b852412020-08-28 13:10:00517<p>But in Lemon, the same rule becomes the following:</p>
drh75897232000-05-29 14:26:00518<pre>
519 expr(A) ::= expr(B) PLUS expr(C). { A = B+C; }
520</pre>
drh7b852412020-08-28 13:10:00521<p>In the Lemon rule, any symbol in parentheses after a grammar rule
drh75897232000-05-29 14:26:00522symbol 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:00524stand for the value of that symbol.</p>
drh75897232000-05-29 14:26:00525
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:00534For example, the rule</p>
drh75897232000-05-29 14:26:00535<pre>
536 expr(A) ::= expr(B) PLUS expr(C). { A = B; }
537</pre>
drh7b852412020-08-28 13:10:00538<p>will generate an error because the linking symbol "C" is used
drh75897232000-05-29 14:26:00539in 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:00546<a id='precrules'></a>
drh60c71b02020-09-01 11:20:03547<h3>4.3 Precedence Rules</h3>
drh75897232000-05-29 14:26:00548
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:34555yacc and bison, Lemon allows a measure of control
556over the resolution of parsing conflicts using precedence rules.
drh75897232000-05-29 14:26:00557A precedence value can be assigned to any terminal symbol
drh9a243e62017-09-20 09:09:34558using 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:00563terminal symbols mentioned in later directives. For example:</p>
564
drh7b852412020-08-28 13:10:00565<pre>
drh75897232000-05-29 14:26:00566 %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:00572</pre>
drh75897232000-05-29 14:26:00573
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:00577attempt to group the ambiguous expression</p>
drh75897232000-05-29 14:26:00578<pre>
579 a AND b OR c
580</pre>
drh7b852412020-08-28 13:10:00581<p>like this</p>
drh75897232000-05-29 14:26:00582<pre>
583 a AND (b OR c).
584</pre>
drh7b852412020-08-28 13:10:00585<p>The associativity (left, right or nonassoc) is used to determine
drh75897232000-05-29 14:26:00586the grouping when the precedence is the same. AND is left-associative
drh7b852412020-08-28 13:10:00587in our example, so</p>
drh75897232000-05-29 14:26:00588<pre>
589 a AND b AND c
590</pre>
drh7b852412020-08-28 13:10:00591<p>is parsed like this</p>
drh75897232000-05-29 14:26:00592<pre>
593 (a AND b) AND c.
594</pre>
drh7b852412020-08-28 13:10:00595<p>The EXP operator is right-associative, though, so</p>
drh75897232000-05-29 14:26:00596<pre>
597 a EXP b EXP c
598</pre>
drh7b852412020-08-28 13:10:00599<p>is parsed like this</p>
drh75897232000-05-29 14:26:00600<pre>
601 a EXP (b EXP c).
602</pre>
drh7b852412020-08-28 13:10:00603<p>The nonassoc precedence is used for non-associative operators.
604So</p>
drh75897232000-05-29 14:26:00605<pre>
606 a EQ b EQ c
607</pre>
drh7b852412020-08-28 13:10:00608<p>is an error.</p>
drh75897232000-05-29 14:26:00609
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:45614you want the precedence of a grammar rule to be something different,
drh75897232000-05-29 14:26:00615you 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:00619<pre>
drh75897232000-05-29 14:26:00620 expr = MINUS expr. [NOT]
drh7b852412020-08-28 13:10:00621</pre>
drh75897232000-05-29 14:26:00622
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:00630as follows:</p>
drh75897232000-05-29 14:26:00631<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:34638<li> If the precedence of the token to be shifted is less than the
drh75897232000-05-29 14:26:00639 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:34644<li> If the precedences are the same and the shift token is
drh75897232000-05-29 14:26:00645 left-associative, then resolve in favor of the reduce.
646 No parsing conflict is reported.
drh9a243e62017-09-20 09:09:34647<li> Otherwise, resolve the conflict by doing the shift, and
648 report a parsing conflict.
drh75897232000-05-29 14:26:00649</ul>
drh7b852412020-08-28 13:10:00650<p>Reduce-reduce conflicts are resolved this way:</p>
drh75897232000-05-29 14:26:00651<ul>
drh9a243e62017-09-20 09:09:34652<li> If either reduce rule
drh75897232000-05-29 14:26:00653 lacks precedence information, then resolve in favor of the
drh9a243e62017-09-20 09:09:34654 rule that appears first in the grammar, and report a parsing
drh75897232000-05-29 14:26:00655 conflict.
drh9a243e62017-09-20 09:09:34656<li> If both rules have precedence and the precedence is different,
drh75897232000-05-29 14:26:00657 then resolve the dispute in favor of the rule with the highest
drh9a243e62017-09-20 09:09:34658 precedence, and do not report a conflict.
drh75897232000-05-29 14:26:00659<li> Otherwise, resolve the conflict by reducing by the rule that
drh9a243e62017-09-20 09:09:34660 appears first in the grammar, and report a parsing conflict.
drh75897232000-05-29 14:26:00661</ul>
662
drh60c71b02020-09-01 11:20:03663<a id="special"></a>
664<h3>4.4 Special Directives</h3>
drh75897232000-05-29 14:26:00665
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:34670<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:00672grammar 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:00676<p>Lemon supports the following special directives:</p>
drh75897232000-05-29 14:26:00677<ul>
drh9a243e62017-09-20 09:09:34678<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:22682<li><tt><a href='#pifdef'>%else</a></tt>
drh9a243e62017-09-20 09:09:34683<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>
drh82bf1372024-01-26 20:34:48686<li><tt><a href='#reallc'>%free</a></tt>
drh5f0d37b2020-07-03 18:07:22687<li><tt><a href='#pifdef'>%if</a></tt>
drh9a243e62017-09-20 09:09:34688<li><tt><a href='#pifdef'>%ifdef</a></tt>
689<li><tt><a href='#pifdef'>%ifndef</a></tt>
690<li><tt><a href='#pinclude'>%include</a></tt>
691<li><tt><a href='#pleft'>%left</a></tt>
692<li><tt><a href='#pname'>%name</a></tt>
693<li><tt><a href='#pnonassoc'>%nonassoc</a></tt>
694<li><tt><a href='#parse_accept'>%parse_accept</a></tt>
695<li><tt><a href='#parse_failure'>%parse_failure</a></tt>
696<li><tt><a href='#pright'>%right</a></tt>
drh82bf1372024-01-26 20:34:48697<li><tt><a href='#reallc'>%realloc</a></tt>
drh9a243e62017-09-20 09:09:34698<li><tt><a href='#stack_overflow'>%stack_overflow</a></tt>
699<li><tt><a href='#stack_size'>%stack_size</a></tt>
700<li><tt><a href='#start_symbol'>%start_symbol</a></tt>
701<li><tt><a href='#syntax_error'>%syntax_error</a></tt>
drh9cffb0f2021-03-28 20:44:01702<li><tt><a href='#token'>%token</a></tt>
drh9a243e62017-09-20 09:09:34703<li><tt><a href='#token_class'>%token_class</a></tt>
704<li><tt><a href='#token_destructor'>%token_destructor</a></tt>
705<li><tt><a href='#token_prefix'>%token_prefix</a></tt>
706<li><tt><a href='#token_type'>%token_type</a></tt>
707<li><tt><a href='#ptype'>%type</a></tt>
708<li><tt><a href='#pwildcard'>%wildcard</a></tt>
drh75897232000-05-29 14:26:00709</ul>
drh7b852412020-08-28 13:10:00710<p>Each of these directives will be described separately in the
drh75897232000-05-29 14:26:00711following sections:</p>
712
drh7b852412020-08-28 13:10:00713<a id='pcode'></a>
drh60c71b02020-09-01 11:20:03714<h4>4.4.1 The <tt>%code</tt> directive</h4>
drhf2340fc2001-06-08 00:25:18715
drh9a243e62017-09-20 09:09:34716<p>The <tt>%code</tt> directive is used to specify additional C code that
drhf2340fc2001-06-08 00:25:18717is added to the end of the main output file. This is similar to
drh9a243e62017-09-20 09:09:34718the <tt><a href='#pinclude'>%include</a></tt> directive except that
719<tt>%include</tt> is inserted at the beginning of the main output file.</p>
drhf2340fc2001-06-08 00:25:18720
drh9a243e62017-09-20 09:09:34721<p><tt>%code</tt> is typically used to include some action routines or perhaps
722a tokenizer or even the "main()" function
drh9bccde32016-03-19 18:00:44723as part of the output file.</p>
drhf2340fc2001-06-08 00:25:18724
drh60c71b02020-09-01 11:20:03725<p>There can be multiple <tt>%code</tt> directives. The arguments of
726all <tt>%code</tt> directives are concatenated.</p>
727
drh7b852412020-08-28 13:10:00728<a id='default_destructor'></a>
drh60c71b02020-09-01 11:20:03729<h4>4.4.2 The <tt>%default_destructor</tt> directive</h4>
drhf2340fc2001-06-08 00:25:18730
drh9a243e62017-09-20 09:09:34731<p>The <tt>%default_destructor</tt> directive specifies a destructor to
drhf2340fc2001-06-08 00:25:18732use for non-terminals that do not have their own destructor
drh9a243e62017-09-20 09:09:34733specified by a separate <tt>%destructor</tt> directive. See the documentation
drh7b852412020-08-28 13:10:00734on the <tt><a href='#destructor'>%destructor</a></tt> directive below for
drh9bccde32016-03-19 18:00:44735additional information.</p>
drhf2340fc2001-06-08 00:25:18736
drh9a243e62017-09-20 09:09:34737<p>In some grammars, many different non-terminal symbols have the
738same data type and hence the same destructor. This directive is
739a convenient way to specify the same destructor for all those
drhf2340fc2001-06-08 00:25:18740non-terminals using a single statement.</p>
741
drh7b852412020-08-28 13:10:00742<a id='default_type'></a>
drh60c71b02020-09-01 11:20:03743<h4>4.4.3 The <tt>%default_type</tt> directive</h4>
drhf2340fc2001-06-08 00:25:18744
drh9a243e62017-09-20 09:09:34745<p>The <tt>%default_type</tt> directive specifies the data type of non-terminal
746symbols that do not have their own data type defined using a separate
747<tt><a href='#ptype'>%type</a></tt> directive.</p>
drhf2340fc2001-06-08 00:25:18748
drh7b852412020-08-28 13:10:00749<a id='destructor'></a>
drh60c71b02020-09-01 11:20:03750<h4>4.4.4 The <tt>%destructor</tt> directive</h4>
drh75897232000-05-29 14:26:00751
drh9a243e62017-09-20 09:09:34752<p>The <tt>%destructor</tt> directive is used to specify a destructor for
drh75897232000-05-29 14:26:00753a non-terminal symbol.
drh9a243e62017-09-20 09:09:34754(See also the <tt><a href='#token_destructor'>%token_destructor</a></tt>
drh9bccde32016-03-19 18:00:44755directive which is used to specify a destructor for terminal symbols.)</p>
drh75897232000-05-29 14:26:00756
757<p>A non-terminal's destructor is called to dispose of the
758non-terminal's value whenever the non-terminal is popped from
drh7b852412020-08-28 13:10:00759the stack. This includes all of the following circumstances:</p>
drh75897232000-05-29 14:26:00760<ul>
761<li> When a rule reduces and the value of a non-terminal on
762 the right-hand side is not linked to C code.
763<li> When the stack is popped during error processing.
764<li> When the ParseFree() function runs.
765</ul>
drh7b852412020-08-28 13:10:00766<p>The destructor can do whatever it wants with the value of
drh75897232000-05-29 14:26:00767the non-terminal, but its design is to deallocate memory
768or other resources held by that non-terminal.</p>
769
drh7b852412020-08-28 13:10:00770<p>Consider an example:</p>
drh75897232000-05-29 14:26:00771<pre>
772 %type nt {void*}
773 %destructor nt { free($$); }
774 nt(A) ::= ID NUM. { A = malloc( 100 ); }
775</pre>
drh7b852412020-08-28 13:10:00776<p>This example is a bit contrived, but it serves to illustrate how
drh75897232000-05-29 14:26:00777destructors work. The example shows a non-terminal named
drh9bccde32016-03-19 18:00:44778"nt" that holds values of type "void*". When the rule for
779an "nt" reduces, it sets the value of the non-terminal to
drh75897232000-05-29 14:26:00780space obtained from malloc(). Later, when the nt non-terminal
781is popped from the stack, the destructor will fire and call
782free() on this malloced space, thus avoiding a memory leak.
drh9bccde32016-03-19 18:00:44783(Note that the symbol "$$" in the destructor code is replaced
drh75897232000-05-29 14:26:00784by the value of the non-terminal.)</p>
785
786<p>It is important to note that the value of a non-terminal is passed
787to the destructor whenever the non-terminal is removed from the
788stack, unless the non-terminal is used in a C-code action. If
789the non-terminal is used by C-code, then it is assumed that the
drh9bccde32016-03-19 18:00:44790C-code will take care of destroying it.
791More commonly, the value is used to build some
drh9a243e62017-09-20 09:09:34792larger structure, and we don't want to destroy it, which is why
drh75897232000-05-29 14:26:00793the destructor is not called in this circumstance.</p>
794
drh9bccde32016-03-19 18:00:44795<p>Destructors help avoid memory leaks by automatically freeing
796allocated objects when they go out of scope.
drh75897232000-05-29 14:26:00797To do the same using yacc or bison is much more difficult.</p>
798
drh7b852412020-08-28 13:10:00799<a id='extraarg'></a>
drh60c71b02020-09-01 11:20:03800<h4>4.4.5 The <tt>%extra_argument</tt> directive</h4>
drh75897232000-05-29 14:26:00801
drh7b852412020-08-28 13:10:00802<p>The <tt>%extra_argument</tt> directive instructs Lemon to add a 4th parameter
drh75897232000-05-29 14:26:00803to the parameter list of the Parse() function it generates. Lemon
804doesn't do anything itself with this extra argument, but it does
805make the argument available to C-code action routines, destructors,
806and so forth. For example, if the grammar file contains:</p>
807
drh7b852412020-08-28 13:10:00808<pre>
drh75897232000-05-29 14:26:00809 %extra_argument { MyStruct *pAbc }
drh7b852412020-08-28 13:10:00810</pre>
drh75897232000-05-29 14:26:00811
812<p>Then the Parse() function generated will have an 4th parameter
drh9bccde32016-03-19 18:00:44813of type "MyStruct*" and all action routines will have access to
814a variable named "pAbc" that is the value of the 4th parameter
drh75897232000-05-29 14:26:00815in the most recent call to Parse().</p>
816
drhfb32c442018-04-21 13:51:42817<p>The <tt>%extra_context</tt> directive works the same except that it
818is passed in on the ParseAlloc() or ParseInit() routines instead of
drh7b852412020-08-28 13:10:00819on Parse().</p>
drhfb32c442018-04-21 13:51:42820
drh7b852412020-08-28 13:10:00821<a id='extractx'></a>
drh60c71b02020-09-01 11:20:03822<h4>4.4.6 The <tt>%extra_context</tt> directive</h4>
drhfb32c442018-04-21 13:51:42823
drh7b852412020-08-28 13:10:00824<p>The <tt>%extra_context</tt> directive instructs Lemon to add a 2nd parameter
825to the parameter list of the ParseAlloc() and ParseInit() functions. Lemon
drhfb32c442018-04-21 13:51:42826doesn't do anything itself with these extra argument, but it does
827store the value make it available to C-code action routines, destructors,
828and so forth. For example, if the grammar file contains:</p>
829
drh7b852412020-08-28 13:10:00830<pre>
drhfb32c442018-04-21 13:51:42831 %extra_context { MyStruct *pAbc }
drh7b852412020-08-28 13:10:00832</pre>
drhfb32c442018-04-21 13:51:42833
drhed5e6682020-03-09 01:02:45834<p>Then the ParseAlloc() and ParseInit() functions will have an 2nd parameter
drhfb32c442018-04-21 13:51:42835of type "MyStruct*" and all action routines will have access to
drhed5e6682020-03-09 01:02:45836a variable named "pAbc" that is the value of that 2nd parameter.</p>
drhfb32c442018-04-21 13:51:42837
838<p>The <tt>%extra_argument</tt> directive works the same except that it
drh7b852412020-08-28 13:10:00839is passed in on the Parse() routine instead of on ParseAlloc()/ParseInit().</p>
drhfb32c442018-04-21 13:51:42840
drh7b852412020-08-28 13:10:00841<a id='pfallback'></a>
drh60c71b02020-09-01 11:20:03842<h4>4.4.7 The <tt>%fallback</tt> directive</h4>
drh9bccde32016-03-19 18:00:44843
drh9a243e62017-09-20 09:09:34844<p>The <tt>%fallback</tt> directive specifies an alternative meaning for one
drh9bccde32016-03-19 18:00:44845or more tokens. The alternative meaning is tried if the original token
drh9a243e62017-09-20 09:09:34846would have generated a syntax error.</p>
drh9bccde32016-03-19 18:00:44847
drh9a243e62017-09-20 09:09:34848<p>The <tt>%fallback</tt> directive was added to support robust parsing of SQL
drh8a6f89c2025-04-10 10:18:07849syntax in <a href='https://sqlite.org/'>SQLite</a>.
drh9bccde32016-03-19 18:00:44850The SQL language contains a large assortment of keywords, each of which
851appears as a different token to the language parser. SQL contains so
drh9a243e62017-09-20 09:09:34852many keywords that it can be difficult for programmers to keep up with
drh9bccde32016-03-19 18:00:44853them all. Programmers will, therefore, sometimes mistakenly use an
drh9a243e62017-09-20 09:09:34854obscure language keyword for an identifier. The <tt>%fallback</tt> directive
drh9bccde32016-03-19 18:00:44855provides a mechanism to tell the parser: "If you are unable to parse
drh9a243e62017-09-20 09:09:34856this keyword, try treating it as an identifier instead."</p>
drh9bccde32016-03-19 18:00:44857
drh7b852412020-08-28 13:10:00858<p>The syntax of <tt>%fallback</tt> is as follows:</p>
drh9bccde32016-03-19 18:00:44859
860<blockquote>
drh9a243e62017-09-20 09:09:34861<tt>%fallback</tt> <i>ID</i> <i>TOKEN...</i> <b>.</b>
862</blockquote></p>
drh9bccde32016-03-19 18:00:44863
drh9a243e62017-09-20 09:09:34864<p>In words, the <tt>%fallback</tt> directive is followed by a list of token
865names terminated by a period.
866The first token name is the fallback token &mdash; the
drh9bccde32016-03-19 18:00:44867token to which all the other tokens fall back to. The second and subsequent
868arguments are tokens which fall back to the token identified by the first
drh9a243e62017-09-20 09:09:34869argument.</p>
drh9bccde32016-03-19 18:00:44870
drh7b852412020-08-28 13:10:00871<a id='pifdef'></a>
drh60c71b02020-09-01 11:20:03872<h4>4.4.8 The <tt>%if</tt> directive and its friends</h4>
drh9bccde32016-03-19 18:00:44873
drh5f0d37b2020-07-03 18:07:22874<p>The <tt>%if</tt>, <tt>%ifdef</tt>, <tt>%ifndef</tt>, <tt>%else</tt>,
875and <tt>%endif</tt> directives
876are similar to #if, #ifdef, #ifndef, #else, and #endif in the C-preprocessor,
drh9a243e62017-09-20 09:09:34877just not as general.
drh9bccde32016-03-19 18:00:44878Each of these directives must begin at the left margin. No whitespace
drh9a243e62017-09-20 09:09:34879is allowed between the "%" and the directive name.</p>
drh9bccde32016-03-19 18:00:44880
drh9a243e62017-09-20 09:09:34881<p>Grammar text in between "<tt>%ifdef MACRO</tt>" and the next nested
882"<tt>%endif</tt>" is
drh9bccde32016-03-19 18:00:44883ignored unless the "-DMACRO" command-line option is used. Grammar text
stephan5d60f472025-02-25 20:55:14884between "<tt>%ifndef MACRO</tt>" and the next nested "<tt>%endif</tt>" is
drh5f0d37b2020-07-03 18:07:22885included except when the "-DMACRO" command-line option is used.<p>
drh9bccde32016-03-19 18:00:44886
drh5f0d37b2020-07-03 18:07:22887<p>The text in between "<tt>%if</tt> <i>CONDITIONAL</i>" and its
888corresponding <tt>%endif</tt> is included only if <i>CONDITIONAL</i>
889is true. The CONDITION is one or more macro names, optionally connected
890using the "||" and "&amp;&amp;" binary operators, the "!" unary operator,
891and grouped using balanced parentheses. Each term is true if the
892corresponding macro exists, and false if it does not exist.</p>
drh9bccde32016-03-19 18:00:44893
drh5f0d37b2020-07-03 18:07:22894<p>An optional "<tt>%else</tt>" directive can occur anywhere in between a
895<tt>%ifdef</tt>, <tt>%ifndef</tt>, or <tt>%if</tt> directive and
896its corresponding <tt>%endif</tt>.</p>
897
898<p>Note that the argument to <tt>%ifdef</tt> and <tt>%ifndef</tt> is
899intended to be a single preprocessor symbol name, not a general expression.
900Use the "<tt>%if</tt>" directive for general expressions.</p>
drh9bccde32016-03-19 18:00:44901
drh7b852412020-08-28 13:10:00902<a id='pinclude'></a>
drh60c71b02020-09-01 11:20:03903<h4>4.4.9 The <tt>%include</tt> directive</h4>
drh75897232000-05-29 14:26:00904
drh9a243e62017-09-20 09:09:34905<p>The <tt>%include</tt> directive specifies C code that is included at the
906top of the generated parser. You can include any text you want &mdash;
drhf2340fc2001-06-08 00:25:18907the Lemon parser generator copies it blindly. If you have multiple
drh9a243e62017-09-20 09:09:34908<tt>%include</tt> directives in your grammar file, their values are concatenated
909so that all <tt>%include</tt> code ultimately appears near the top of the
910generated parser, in the same order as it appeared in the grammar.</p>
drh75897232000-05-29 14:26:00911
drh9a243e62017-09-20 09:09:34912<p>The <tt>%include</tt> directive is very handy for getting some extra #include
drh75897232000-05-29 14:26:00913preprocessor statements at the beginning of the generated parser.
914For example:</p>
915
drh7b852412020-08-28 13:10:00916<pre>
drh75897232000-05-29 14:26:00917 %include {#include &lt;unistd.h&gt;}
drh7b852412020-08-28 13:10:00918</pre>
drh75897232000-05-29 14:26:00919
920<p>This might be needed, for example, if some of the C actions in the
drh9a243e62017-09-20 09:09:34921grammar call functions that are prototyped in unistd.h.</p>
drh75897232000-05-29 14:26:00922
drh60ce5d32018-11-27 14:34:33923<p>Use the <tt><a href="#pcode">%code</a></tt> directive to add code to
924the end of the generated parser.</p>
925
drh7b852412020-08-28 13:10:00926<a id='pleft'></a>
drh60c71b02020-09-01 11:20:03927<h4>4.4.10 The <tt>%left</tt> directive</h4>
drh75897232000-05-29 14:26:00928
drh9a243e62017-09-20 09:09:34929The <tt>%left</tt> directive is used (along with the
930<tt><a href='#pright'>%right</a></tt> and
931<tt><a href='#pnonassoc'>%nonassoc</a></tt> directives) to declare
932precedences of terminal symbols.
933Every terminal symbol whose name appears after
934a <tt>%left</tt> directive but before the next period (".") is
drh75897232000-05-29 14:26:00935given the same left-associative precedence value. Subsequent
drh9a243e62017-09-20 09:09:34936<tt>%left</tt> directives have higher precedence. For example:</p>
drh75897232000-05-29 14:26:00937
drh7b852412020-08-28 13:10:00938<pre>
drh75897232000-05-29 14:26:00939 %left AND.
940 %left OR.
941 %nonassoc EQ NE GT GE LT LE.
942 %left PLUS MINUS.
943 %left TIMES DIVIDE MOD.
944 %right EXP NOT.
drh7b852412020-08-28 13:10:00945</pre>
drh75897232000-05-29 14:26:00946
drh9a243e62017-09-20 09:09:34947<p>Note the period that terminates each <tt>%left</tt>,
948<tt>%right</tt> or <tt>%nonassoc</tt>
drh75897232000-05-29 14:26:00949directive.</p>
950
951<p>LALR(1) grammars can get into a situation where they require
952a large amount of stack space if you make heavy use or right-associative
drh9a243e62017-09-20 09:09:34953operators. For this reason, it is recommended that you use <tt>%left</tt>
954rather than <tt>%right</tt> whenever possible.</p>
drh75897232000-05-29 14:26:00955
drh7b852412020-08-28 13:10:00956<a id='pname'></a>
drh60c71b02020-09-01 11:20:03957<h4>4.4.11 The <tt>%name</tt> directive</h4>
drh75897232000-05-29 14:26:00958
959<p>By default, the functions generated by Lemon all begin with the
drh9bccde32016-03-19 18:00:44960five-character string "Parse". You can change this string to something
drh9a243e62017-09-20 09:09:34961different using the <tt>%name</tt> directive. For instance:</p>
drh75897232000-05-29 14:26:00962
drh7b852412020-08-28 13:10:00963<pre>
drh75897232000-05-29 14:26:00964 %name Abcde
drh7b852412020-08-28 13:10:00965</pre>
drh75897232000-05-29 14:26:00966
967<p>Putting this directive in the grammar file will cause Lemon to generate
drh7b852412020-08-28 13:10:00968functions named</p>
drh75897232000-05-29 14:26:00969<ul>
970<li> AbcdeAlloc(),
971<li> AbcdeFree(),
972<li> AbcdeTrace(), and
973<li> Abcde().
974</ul>
drh7b852412020-08-28 13:10:00975</p>The <tt>%name</tt> directive allows you to generate two or more different
drh9a243e62017-09-20 09:09:34976parsers and link them all into the same executable.</p>
drh75897232000-05-29 14:26:00977
drh7b852412020-08-28 13:10:00978<a id='pnonassoc'></a>
drh60c71b02020-09-01 11:20:03979<h4>4.4.12 The <tt>%nonassoc</tt> directive</h4>
drh75897232000-05-29 14:26:00980
981<p>This directive is used to assign non-associative precedence to
drh9a243e62017-09-20 09:09:34982one or more terminal symbols. See the section on
drh9bccde32016-03-19 18:00:44983<a href='#precrules'>precedence rules</a>
drh9a243e62017-09-20 09:09:34984or on the <tt><a href='#pleft'>%left</a></tt> directive
985for additional information.</p>
drh75897232000-05-29 14:26:00986
drh7b852412020-08-28 13:10:00987<a id='parse_accept'></a>
drh60c71b02020-09-01 11:20:03988<h4>4.4.13 The <tt>%parse_accept</tt> directive</h4>
drh75897232000-05-29 14:26:00989
drh9a243e62017-09-20 09:09:34990<p>The <tt>%parse_accept</tt> directive specifies a block of C code that is
drh9bccde32016-03-19 18:00:44991executed whenever the parser accepts its input string. To "accept"
drh75897232000-05-29 14:26:00992an input string means that the parser was able to process all tokens
993without error.</p>
994
995<p>For example:</p>
996
drh7b852412020-08-28 13:10:00997<pre>
drh75897232000-05-29 14:26:00998 %parse_accept {
999 printf("parsing complete!\n");
1000 }
drh7b852412020-08-28 13:10:001001</pre>
drh75897232000-05-29 14:26:001002
drh7b852412020-08-28 13:10:001003<a id='parse_failure'></a>
drh60c71b02020-09-01 11:20:031004<h4>4.4.14 The <tt>%parse_failure</tt> directive</h4>
drh75897232000-05-29 14:26:001005
drh9a243e62017-09-20 09:09:341006<p>The <tt>%parse_failure</tt> directive specifies a block of C code that
drh75897232000-05-29 14:26:001007is executed whenever the parser fails complete. This code is not
1008executed until the parser has tried and failed to resolve an input
1009error using is usual error recovery strategy. The routine is
1010only invoked when parsing is unable to continue.</p>
1011
drh7b852412020-08-28 13:10:001012<pre>
drh75897232000-05-29 14:26:001013 %parse_failure {
1014 fprintf(stderr,"Giving up. Parser is hopelessly lost...\n");
1015 }
drh7b852412020-08-28 13:10:001016</pre>
drh75897232000-05-29 14:26:001017
drh7b852412020-08-28 13:10:001018<a id='pright'></a>
drh60c71b02020-09-01 11:20:031019<h4>4.4.15 The <tt>%right</tt> directive</h4>
drh75897232000-05-29 14:26:001020
1021<p>This directive is used to assign right-associative precedence to
drh9a243e62017-09-20 09:09:341022one or more terminal symbols. See the section on
drh9bccde32016-03-19 18:00:441023<a href='#precrules'>precedence rules</a>
1024or on the <a href='#pleft'>%left</a> directive for additional information.</p>
drh75897232000-05-29 14:26:001025
drh7b852412020-08-28 13:10:001026<a id='stack_overflow'></a>
drh60c71b02020-09-01 11:20:031027<h4>4.4.16 The <tt>%stack_overflow</tt> directive</h4>
drh75897232000-05-29 14:26:001028
drh9a243e62017-09-20 09:09:341029<p>The <tt>%stack_overflow</tt> directive specifies a block of C code that
drh75897232000-05-29 14:26:001030is executed if the parser's internal stack ever overflows. Typically
1031this just prints an error message. After a stack overflow, the parser
1032will be unable to continue and must be reset.</p>
1033
drh7b852412020-08-28 13:10:001034<pre>
drh75897232000-05-29 14:26:001035 %stack_overflow {
1036 fprintf(stderr,"Giving up. Parser stack overflow\n");
1037 }
drh7b852412020-08-28 13:10:001038</pre>
drh75897232000-05-29 14:26:001039
1040<p>You can help prevent parser stack overflows by avoiding the use
1041of right recursion and right-precedence operators in your grammar.
drh9a243e62017-09-20 09:09:341042Use left recursion and and left-precedence operators instead to
drh75897232000-05-29 14:26:001043encourage rules to reduce sooner and keep the stack size down.
drh7b852412020-08-28 13:10:001044For example, do rules like this:</p>
drh75897232000-05-29 14:26:001045<pre>
1046 list ::= list element. // left-recursion. Good!
1047 list ::= .
1048</pre>
drh7b852412020-08-28 13:10:001049<p>Not like this:</p>
drh75897232000-05-29 14:26:001050<pre>
1051 list ::= element list. // right-recursion. Bad!
1052 list ::= .
drh7b852412020-08-28 13:10:001053</pre>
drh75897232000-05-29 14:26:001054
drh7b852412020-08-28 13:10:001055<a id='stack_size'></a>
drh60c71b02020-09-01 11:20:031056<h4>4.4.17 The <tt>%stack_size</tt> directive</h4>
drh75897232000-05-29 14:26:001057
1058<p>If stack overflow is a problem and you can't resolve the trouble
1059by using left-recursion, then you might want to increase the size
1060of the parser's stack using this directive. Put an positive integer
drh9a243e62017-09-20 09:09:341061after the <tt>%stack_size</tt> directive and Lemon will generate a parse
drh75897232000-05-29 14:26:001062with a stack of the requested size. The default value is 100.</p>
1063
drh7b852412020-08-28 13:10:001064<pre>
drh75897232000-05-29 14:26:001065 %stack_size 2000
drh7b852412020-08-28 13:10:001066</pre>
drh75897232000-05-29 14:26:001067
drh7b852412020-08-28 13:10:001068<a id='start_symbol'></a>
drh60c71b02020-09-01 11:20:031069<h4>4.4.18 The <tt>%start_symbol</tt> directive</h4>
drh75897232000-05-29 14:26:001070
drh9a243e62017-09-20 09:09:341071<p>By default, the start symbol for the grammar that Lemon generates
drh75897232000-05-29 14:26:001072is the first non-terminal that appears in the grammar file. But you
drh9a243e62017-09-20 09:09:341073can choose a different start symbol using the
1074<tt>%start_symbol</tt> directive.</p>
drh75897232000-05-29 14:26:001075
drh7b852412020-08-28 13:10:001076<pre>
drh75897232000-05-29 14:26:001077 %start_symbol prog
drh7b852412020-08-28 13:10:001078</pre>
drh75897232000-05-29 14:26:001079
drh7b852412020-08-28 13:10:001080<a id='syntax_error'></a>
drh60c71b02020-09-01 11:20:031081<h4>4.4.19 The <tt>%syntax_error</tt> directive</h4>
drh9a243e62017-09-20 09:09:341082
drh1e2896e2021-01-16 12:15:411083<p>See <a href='#errors'>Error Processing</a>.</p>
drh9a243e62017-09-20 09:09:341084
drh9cffb0f2021-03-28 20:44:011085<a id='token'></a>
1086<h4>4.4.20 The <tt>%token</tt> directive</h4>
1087
1088<p>Tokens are normally created automatically, the first time they are used.
1089Any identifier that begins with an upper-case letter is a token.
1090
1091<p>Sometimes it is useful to declare tokens in advance, however. The
1092integer values assigned to each token determined by the order in which
1093the tokens are seen. So by declaring tokens in advance, it is possible to
1094cause some tokens to have low-numbered values, which might be desirable in
1095some grammers, or to have sequential values assigned to a sequence of
1096related tokens. For this reason, the %token directive is provided to
1097declare tokens in advance. The syntax is as follows:
1098
1099<blockquote>
1100<tt>%token</tt> <i>TOKEN</i> <i>TOKEN...</i> <b>.</b>
1101</blockquote></p>
1102
1103<p>The %token directive is followed by zero or more token symbols and
1104terminated by a single ".". Each token named is created if it does not
1105already exist. Tokens are created in order.
1106
1107
drh7b852412020-08-28 13:10:001108<a id='token_class'></a>
drh9cffb0f2021-03-28 20:44:011109<h4>4.4.21 The <tt>%token_class</tt> directive</h4>
drh9a243e62017-09-20 09:09:341110
1111<p>Undocumented. Appears to be related to the MULTITERMINAL concept.
1112<a href='http://sqlite.org/src/fdiff?v1=796930d5fc2036c7&v2=624b24c5dc048e09&sbs=0'>Implementation</a>.</p>
1113
drh7b852412020-08-28 13:10:001114<a id='token_destructor'></a>
drh9cffb0f2021-03-28 20:44:011115<h4>4.4.22 The <tt>%token_destructor</tt> directive</h4>
drh75897232000-05-29 14:26:001116
drh9a243e62017-09-20 09:09:341117<p>The <tt>%destructor</tt> directive assigns a destructor to a non-terminal
1118symbol. (See the description of the
1119<tt><a href='%destructor'>%destructor</a></tt> directive above.)
1120The <tt>%token_destructor</tt> directive does the same thing
1121for all terminal symbols.</p>
drh75897232000-05-29 14:26:001122
drh7b852412020-08-28 13:10:001123<p>Unlike non-terminal symbols, which may each have a different data type
drh75897232000-05-29 14:26:001124for their values, terminals all use the same data type (defined by
drh9a243e62017-09-20 09:09:341125the <tt><a href='#token_type'>%token_type</a></tt> directive)
1126and so they use a common destructor.
1127Other than that, the token destructor works just like the non-terminal
drh75897232000-05-29 14:26:001128destructors.</p>
1129
drh7b852412020-08-28 13:10:001130<a id='token_prefix'></a>
drh9cffb0f2021-03-28 20:44:011131<h4>4.4.23 The <tt>%token_prefix</tt> directive</h4>
drh75897232000-05-29 14:26:001132
1133<p>Lemon generates #defines that assign small integer constants
1134to each terminal symbol in the grammar. If desired, Lemon will
1135add a prefix specified by this directive
drh9a243e62017-09-20 09:09:341136to each of the #defines it generates.</p>
1137
drh7b852412020-08-28 13:10:001138<p>So if the default output of Lemon looked like this:</p>
drh75897232000-05-29 14:26:001139<pre>
1140 #define AND 1
1141 #define MINUS 2
1142 #define OR 3
1143 #define PLUS 4
1144</pre>
drh7b852412020-08-28 13:10:001145<p>You can insert a statement into the grammar like this:</p>
drh75897232000-05-29 14:26:001146<pre>
1147 %token_prefix TOKEN_
1148</pre>
drh7b852412020-08-28 13:10:001149<p>to cause Lemon to produce these symbols instead:</p>
drh75897232000-05-29 14:26:001150<pre>
1151 #define TOKEN_AND 1
1152 #define TOKEN_MINUS 2
1153 #define TOKEN_OR 3
1154 #define TOKEN_PLUS 4
drh7b852412020-08-28 13:10:001155</pre>
drh75897232000-05-29 14:26:001156
drh7b852412020-08-28 13:10:001157<a id='token_type'></a><a id='ptype'></a>
drh9cffb0f2021-03-28 20:44:011158<h4>4.4.24 The <tt>%token_type</tt> and <tt>%type</tt> directives</h4>
drh75897232000-05-29 14:26:001159
1160<p>These directives are used to specify the data types for values
1161on the parser's stack associated with terminal and non-terminal
1162symbols. The values of all terminal symbols must be of the same
1163type. This turns out to be the same data type as the 3rd parameter
1164to the Parse() function generated by Lemon. Typically, you will
drhed5e6682020-03-09 01:02:451165make the value of a terminal symbol be a pointer to some kind of
drh75897232000-05-29 14:26:001166token structure. Like this:</p>
1167
drh7b852412020-08-28 13:10:001168<pre>
drh75897232000-05-29 14:26:001169 %token_type {Token*}
drh7b852412020-08-28 13:10:001170</pre>
drh75897232000-05-29 14:26:001171
1172<p>If the data type of terminals is not specified, the default value
drhdfe4e6b2016-10-08 13:34:081173is "void*".</p>
drh75897232000-05-29 14:26:001174
1175<p>Non-terminal symbols can each have their own data types. Typically
drh9a243e62017-09-20 09:09:341176the data type of a non-terminal is a pointer to the root of a parse tree
drh75897232000-05-29 14:26:001177structure that contains all information about that non-terminal.
1178For example:</p>
1179
drh7b852412020-08-28 13:10:001180<pre>
drh75897232000-05-29 14:26:001181 %type expr {Expr*}
drh7b852412020-08-28 13:10:001182</pre>
drh75897232000-05-29 14:26:001183
1184<p>Each entry on the parser's stack is actually a union containing
1185instances of all data types for every non-terminal and terminal symbol.
1186Lemon will automatically use the correct element of this union depending
1187on what the corresponding non-terminal or terminal symbol is. But
1188the grammar designer should keep in mind that the size of the union
1189will be the size of its largest element. So if you have a single
1190non-terminal whose data type requires 1K of storage, then your 100
1191entry parser stack will require 100K of heap space. If you are willing
1192and able to pay that price, fine. You just need to know.</p>
1193
drh7b852412020-08-28 13:10:001194<a id='pwildcard'></a>
drh9cffb0f2021-03-28 20:44:011195<h4>4.4.25 The <tt>%wildcard</tt> directive</h4>
drh9bccde32016-03-19 18:00:441196
drh9a243e62017-09-20 09:09:341197<p>The <tt>%wildcard</tt> directive is followed by a single token name and a
1198period. This directive specifies that the identified token should
1199match any input token.</p>
drh9bccde32016-03-19 18:00:441200
1201<p>When the generated parser has the choice of matching an input against
1202the wildcard token and some other token, the other token is always used.
drh9a243e62017-09-20 09:09:341203The wildcard token is only matched if there are no alternatives.</p>
drh9bccde32016-03-19 18:00:441204
drh82bf1372024-01-26 20:34:481205<a id='reallc'></a>
1206<h4>4.4.26 The <tt>%realloc</tt> and <tt>%free</tt> directives</h4>
1207
1208<p>The <tt>%realloc</tt> and <tt>%free</tt> directives defines function
1209that allocate and free heap memory. The signatures of these functions
1210should be the same as the realloc() and free() functions from the standard
1211C library.
1212
1213<p>If both of these functions are defined
1214then these functions are used to allocate and free
1215memory for supplemental parser stack space, if the initial
1216parse stack space is exceeded. The initial parser stack size
1217is specified by either <tt>%stack_size</tt> or the
1218-DYYSTACKDEPTH compile-time flag.
1219
drh1e2896e2021-01-16 12:15:411220<a id='errors'></a>
drh60c71b02020-09-01 11:20:031221<h2>5.0 Error Processing</h2>
drh75897232000-05-29 14:26:001222
1223<p>After extensive experimentation over several years, it has been
1224discovered that the error recovery strategy used by yacc is about
1225as good as it gets. And so that is what Lemon uses.</p>
1226
1227<p>When a Lemon-generated parser encounters a syntax error, it
drh9a243e62017-09-20 09:09:341228first invokes the code specified by the <tt>%syntax_error</tt> directive, if
drh75897232000-05-29 14:26:001229any. It then enters its error recovery strategy. The error recovery
1230strategy is to begin popping the parsers stack until it enters a
1231state where it is permitted to shift a special non-terminal symbol
drh9bccde32016-03-19 18:00:441232named "error". It then shifts this non-terminal and continues
drh9a243e62017-09-20 09:09:341233parsing. The <tt>%syntax_error</tt> routine will not be called again
drh75897232000-05-29 14:26:001234until at least three new tokens have been successfully shifted.</p>
1235
1236<p>If the parser pops its stack until the stack is empty, and it still
drh9a243e62017-09-20 09:09:341237is unable to shift the error symbol, then the
1238<tt><a href='#parse_failure'>%parse_failure</a></tt> routine
drh75897232000-05-29 14:26:001239is invoked and the parser resets itself to its start state, ready
1240to begin parsing a new file. This is what will happen at the very
drh9a243e62017-09-20 09:09:341241first syntax error, of course, if there are no instances of the
drh9bccde32016-03-19 18:00:441242"error" non-terminal in your grammar.</p>
drh75897232000-05-29 14:26:001243
drh82bf1372024-01-26 20:34:481244
drh60c71b02020-09-01 11:20:031245<a id='history'></a>
1246<h2>6.0 History of Lemon</h2>
1247
1248<p>Lemon was originally written by Richard Hipp sometime in the late
12491980s on a Sun4 Workstation using K&amp;R C.
drhaf885d92023-08-23 18:42:041250There was a companion LL(1) parser generator program named "Lime".
1251The Lime source code has been lost.</p>
drh60c71b02020-09-01 11:20:031252
1253<p>The lemon.c source file was originally many separate files that were
1254compiled together to generate the "lemon" executable. Sometime in the
12551990s, the individual source code files were combined together into
1256the current single large "lemon.c" source file. You can still see traces
1257of original filenames in the code.</p>
1258
1259<p>Since 2001, Lemon has been part of the
1260<a href="https://sqlite.org/">SQLite project</a> and the source code
1261to Lemon has been managed as a part of the
1262<a href="https://sqlite.org/src">SQLite source tree</a> in the following
1263files:</p>
1264
1265<ul>
1266<li> <a href="https://sqlite.org/src/file/tool/lemon.c">tool/lemon.c</a>
1267<li> <a href="https://sqlite.org/src/file/tool/lempar.c">tool/lempar.c</a>
1268<li> <a href="https://sqlite.org/src/file/doc/lemon.html">doc/lemon.html</a>
1269</ul>
1270
1271<a id="copyright"></a>
1272<h2>7.0 Copyright</h2>
1273
1274<p>All of the source code to Lemon, including the template parser file
1275"lempar.c" and this documentation file ("lemon.html") are in the public
1276domain. You can use the code for any purpose and without attribution.</p>
1277
1278<p>The code comes with no warranty. If it breaks, you get to keep both
1279pieces.</p>
1280
drh75897232000-05-29 14:26:001281</body>
1282</html>