Updated gitignore and Engine/bin for ticket #1

.gitignore

@@ -168,3 +168,4 @@ pip-log.txt
 *.dso
 console.log
 *.cached.dts
+!Engine/bin

Engine/bin/bison/bison.hairy

@@ -0,0 +1,334 @@
+
+extern int timeclock;
+
+
+int yyerror;		/*  Yyerror and yycost are set by guards.	*/
+int yycost;		/*  If yyerror is set to a nonzero value by a	*/
+			/*  guard, the reduction with which the guard	*/
+			/*  is associated is not performed, and the	*/
+			/*  error recovery mechanism is invoked.	*/
+			/*  Yycost indicates the cost of performing	*/
+			/*  the reduction given the attributes of the	*/
+			/*  symbols.					*/
+
+
+/*  YYMAXDEPTH indicates the size of the parser's state and value	*/
+/*  stacks.								*/
+
+#ifndef	YYMAXDEPTH
+#define	YYMAXDEPTH	500
+#endif
+
+/*  YYMAXRULES must be at least as large as the number of rules that	*/
+/*  could be placed in the rule queue.  That number could be determined	*/
+/*  from the grammar and the size of the stack, but, as yet, it is not.	*/
+
+#ifndef	YYMAXRULES
+#define	YYMAXRULES	100
+#endif
+
+#ifndef	YYMAXBACKUP
+#define YYMAXBACKUP	100
+#endif
+
+
+short	yyss[YYMAXDEPTH];	/*  the state stack			*/
+YYSTYPE	yyvs[YYMAXDEPTH];	/*  the semantic value stack		*/
+YYLTYPE yyls[YYMAXDEPTH];	/*  the location stack			*/
+short	yyrq[YYMAXRULES];	/*  the rule queue			*/
+int	yychar;			/*  the lookahead symbol		*/
+
+YYSTYPE	yylval;			/*  the semantic value of the		*/
+				/*  lookahead symbol			*/
+
+YYSTYPE yytval;			/*  the semantic value for the state	*/
+				/*  at the top of the state stack.	*/
+
+YYSTYPE yyval;			/*  the variable used to return		*/
+				/*  semantic values from the action	*/
+				/*  routines				*/
+
+YYLTYPE yylloc;		/*  location data for the lookahead	*/
+				/*  symbol				*/
+
+YYLTYPE yytloc;		/*  location data for the state at the	*/
+				/*  top of the state stack		*/
+
+
+int	yynunlexed;
+short	yyunchar[YYMAXBACKUP];
+YYSTYPE	yyunval[YYMAXBACKUP];
+YYLTYPE yyunloc[YYMAXBACKUP];
+
+short *yygssp;			/*  a pointer to the top of the state	*/
+				/*  stack; only set during error	*/
+				/*  recovery.				*/
+
+YYSTYPE *yygvsp;		/*  a pointer to the top of the value	*/
+				/*  stack; only set during error	*/
+				/*  recovery.				*/
+
+YYLTYPE *yyglsp;		/*  a pointer to the top of the		*/
+				/*  location stack; only set during	*/
+				/*  error recovery.			*/
+
+
+/*  Yyget is an interface between the parser and the lexical analyzer.	*/
+/*  It is costly to provide such an interface, but it avoids requiring	*/
+/*  the lexical analyzer to be able to back up the scan.		*/
+
+yyget()
+{
+  if (yynunlexed > 0)
+    {
+      yynunlexed--;
+      yychar = yyunchar[yynunlexed];
+      yylval = yyunval[yynunlexed];
+      yylloc = yyunloc[yynunlexed];
+    }
+  else if (yychar <= 0)
+    yychar = 0;
+  else
+    {
+      yychar = yylex();
+      if (yychar < 0)
+	yychar = 0;
+      else yychar = YYTRANSLATE(yychar);
+    }
+}
+
+
+
+yyunlex(chr, val, loc)
+int chr;
+YYSTYPE val;
+YYLTYPE loc;
+{
+  yyunchar[yynunlexed] = chr;
+  yyunval[yynunlexed] = val;
+  yyunloc[yynunlexed] = loc;
+  yynunlexed++;
+}
+
+
+
+yyrestore(first, last)
+register short *first;
+register short *last;
+{
+  register short *ssp;
+  register short *rp;
+  register int symbol;
+  register int state;
+  register int tvalsaved;
+
+  ssp = yygssp;
+  yyunlex(yychar, yylval, yylloc);
+
+  tvalsaved = 0;
+  while (first != last)
+    {
+      symbol = yystos[*ssp];
+      if (symbol < YYNTBASE)
+	{
+	  yyunlex(symbol, yytval, yytloc);
+	  tvalsaved = 1;
+	  ssp--;
+	}
+
+      ssp--;
+
+      if (first == yyrq)
+	first = yyrq + YYMAXRULES;
+
+      first--;
+
+      for (rp = yyrhs + yyprhs[*first]; symbol = *rp; rp++)
+	{
+	  if (symbol < YYNTBASE)
+	    state = yytable[yypact[*ssp] + symbol];
+	  else
+	    {
+	      state = yypgoto[symbol - YYNTBASE] + *ssp;
+
+	      if (state >= 0 && state <= YYLAST && yycheck[state] == *ssp)
+		state = yytable[state];
+	      else
+		state = yydefgoto[symbol - YYNTBASE];
+	    }
+
+	  *++ssp = state;
+	}
+    }
+
+  if ( ! tvalsaved && ssp > yyss)
+    {
+      yyunlex(yystos[*ssp], yytval, yytloc);
+      ssp--;
+    }
+
+  yygssp = ssp;
+}
+
+
+
+int
+yyparse()
+{
+  register int yystate;
+  register int yyn;
+  register short *yyssp;
+  register short *yyrq0;
+  register short *yyptr;
+  register YYSTYPE *yyvsp;
+
+  int yylen;
+  YYLTYPE *yylsp;
+  short *yyrq1;
+  short *yyrq2;
+
+  yystate = 0;
+  yyssp = yyss - 1;
+  yyvsp = yyvs - 1;
+  yylsp = yyls - 1;
+  yyrq0 = yyrq;
+  yyrq1 = yyrq0;
+  yyrq2 = yyrq0;
+
+  yychar = yylex();
+  if (yychar < 0)
+    yychar = 0;
+  else yychar = YYTRANSLATE(yychar);
+
+yynewstate:
+
+  if (yyssp >= yyss + YYMAXDEPTH - 1)
+    {
+      yyabort("Parser Stack Overflow");
+      YYABORT;
+    }
+
+  *++yyssp = yystate;
+
+yyresume:
+
+  yyn = yypact[yystate];
+  if (yyn == YYFLAG)
+    goto yydefault;
+
+  yyn += yychar;
+  if (yyn < 0 || yyn > YYLAST || yycheck[yyn] != yychar)
+    goto yydefault;
+
+  yyn = yytable[yyn];
+  if (yyn < 0)
+    {
+      yyn = -yyn;
+      goto yyreduce;
+    }
+  else if (yyn == 0)
+    goto yyerrlab;
+
+  yystate = yyn;
+
+  yyptr = yyrq2;
+  while (yyptr != yyrq1)
+    {
+      yyn = *yyptr++;
+      yylen = yyr2[yyn];
+      yyvsp -= yylen;
+      yylsp -= yylen;
+
+      yyguard(yyn, yyvsp, yylsp);
+      if (yyerror)
+	goto yysemerr;
+
+      yyaction(yyn, yyvsp, yylsp);
+      *++yyvsp = yyval;
+
+      yylsp++;
+      if (yylen == 0)
+	{
+	  yylsp->timestamp = timeclock;
+	  yylsp->first_line = yytloc.first_line;
+	  yylsp->first_column = yytloc.first_column;
+	  yylsp->last_line = (yylsp-1)->last_line;
+	  yylsp->last_column = (yylsp-1)->last_column;
+	  yylsp->text = 0;
+	}
+      else
+	{
+	  yylsp->last_line = (yylsp+yylen-1)->last_line;
+	  yylsp->last_column = (yylsp+yylen-1)->last_column;
+	}
+	  
+      if (yyptr == yyrq + YYMAXRULES)
+        yyptr = yyrq;
+    }
+
+  if (yystate == YYFINAL)
+    YYACCEPT;
+
+  yyrq2 = yyptr;
+  yyrq1 = yyrq0;
+
+  *++yyvsp = yytval;
+  *++yylsp = yytloc;
+  yytval = yylval;
+  yytloc = yylloc;
+  yyget();
+
+  goto yynewstate;
+
+yydefault:
+
+  yyn = yydefact[yystate];
+  if (yyn == 0)
+    goto yyerrlab;
+
+yyreduce:
+
+  *yyrq0++ = yyn;
+
+  if (yyrq0 == yyrq + YYMAXRULES)
+    yyrq0 = yyrq;
+
+  if (yyrq0 == yyrq2)
+    {
+      yyabort("Parser Rule Queue Overflow");
+      YYABORT;
+    }
+
+  yyssp -= yyr2[yyn];
+  yyn = yyr1[yyn];
+
+  yystate = yypgoto[yyn - YYNTBASE] + *yyssp;
+  if (yystate >= 0 && yystate <= YYLAST && yycheck[yystate] == *yyssp)
+    yystate = yytable[yystate];
+  else
+    yystate = yydefgoto[yyn - YYNTBASE];
+
+  goto yynewstate;
+
+yysemerr:
+  *--yyptr = yyn;
+  yyrq2 = yyptr;
+  yyvsp += yyr2[yyn];
+
+yyerrlab:
+
+  yygssp = yyssp;
+  yygvsp = yyvsp;
+  yyglsp = yylsp;
+  yyrestore(yyrq0, yyrq2);
+  yyrecover();
+  yystate = *yygssp;
+  yyssp = yygssp;
+  yyvsp = yygvsp;
+  yyrq0 = yyrq;
+  yyrq1 = yyrq0;
+  yyrq2 = yyrq0;
+  goto yyresume;
+}
+
+$

Engine/bin/bison/bison.html

@@ -0,0 +1,4501 @@
+<HTML>
+<HEAD>
+<!-- This HTML file has been created by texi2html 1.52
+     from bison.texinfo on 2 October 1998 -->
+<TITLE>Bison 1.24
+</TITLE>
+</HEAD>
+<BODY>
+<H1>Bison
+</H1>
+<H2>The YACC-compatible Parser Generator
+</H2>
+<H2>May 1995, Bison Version 1.24
+</H2>
+<ADDRESS>by Charles Donnelly and Richard Stallman
+</ADDRESS>
+<P>
+<P><HR><P>
+<H1>Table of Contents</H1>
+<UL>
+<LI><A NAME="TOC1" HREF="bison.html#SEC1">Introduction</A>
+<LI><A NAME="TOC2" HREF="bison.html#SEC2">Conditions for Using Bison</A>
+<LI><A NAME="TOC3" HREF="bison.html#SEC3">GNU GENERAL PUBLIC LICENSE</A>
+<UL>
+<LI><A NAME="TOC4" HREF="bison.html#SEC4">Preamble</A>
+<LI><A NAME="TOC5" HREF="bison.html#SEC5">TERMS AND CONDITIONS FOR COPYING, DISTRIBUTION AND MODIFICATION</A>
+<LI><A NAME="TOC6" HREF="bison.html#SEC6">How to Apply These Terms to Your New Programs</A>
+</UL>
+<LI><A NAME="TOC7" HREF="bison.html#SEC7">The Concepts of Bison</A>
+<UL>
+<LI><A NAME="TOC8" HREF="bison.html#SEC8">Languages and Context-Free Grammars</A>
+<LI><A NAME="TOC9" HREF="bison.html#SEC9">From Formal Rules to Bison Input</A>
+<LI><A NAME="TOC10" HREF="bison.html#SEC10">Semantic Values</A>
+<LI><A NAME="TOC11" HREF="bison.html#SEC11">Semantic Actions</A>
+<LI><A NAME="TOC12" HREF="bison.html#SEC12">Bison Output: the Parser File</A>
+<LI><A NAME="TOC13" HREF="bison.html#SEC13">Stages in Using Bison</A>
+<LI><A NAME="TOC14" HREF="bison.html#SEC14">The Overall Layout of a Bison Grammar</A>
+</UL>
+<LI><A NAME="TOC15" HREF="bison.html#SEC15">Examples</A>
+<UL>
+<LI><A NAME="TOC16" HREF="bison.html#SEC16">Reverse Polish Notation Calculator</A>
+<UL>
+<LI><A NAME="TOC17" HREF="bison.html#SEC17">Declarations for <CODE>rpcalc</CODE></A>
+<LI><A NAME="TOC18" HREF="bison.html#SEC18">Grammar Rules for <CODE>rpcalc</CODE></A>
+<UL>
+<LI><A NAME="TOC19" HREF="bison.html#SEC19">Explanation of <CODE>input</CODE></A>
+<LI><A NAME="TOC20" HREF="bison.html#SEC20">Explanation of <CODE>line</CODE></A>
+<LI><A NAME="TOC21" HREF="bison.html#SEC21">Explanation of <CODE>expr</CODE></A>
+</UL>
+<LI><A NAME="TOC22" HREF="bison.html#SEC22">The <CODE>rpcalc</CODE> Lexical Analyzer</A>
+<LI><A NAME="TOC23" HREF="bison.html#SEC23">The Controlling Function</A>
+<LI><A NAME="TOC24" HREF="bison.html#SEC24">The Error Reporting Routine</A>
+<LI><A NAME="TOC25" HREF="bison.html#SEC25">Running Bison to Make the Parser</A>
+<LI><A NAME="TOC26" HREF="bison.html#SEC26">Compiling the Parser File</A>
+</UL>
+<LI><A NAME="TOC27" HREF="bison.html#SEC27">Infix Notation Calculator: <CODE>calc</CODE></A>
+<LI><A NAME="TOC28" HREF="bison.html#SEC28">Simple Error Recovery</A>
+<LI><A NAME="TOC29" HREF="bison.html#SEC29">Multi-Function Calculator: <CODE>mfcalc</CODE></A>
+<UL>
+<LI><A NAME="TOC30" HREF="bison.html#SEC30">Declarations for <CODE>mfcalc</CODE></A>
+<LI><A NAME="TOC31" HREF="bison.html#SEC31">Grammar Rules for <CODE>mfcalc</CODE></A>
+<LI><A NAME="TOC32" HREF="bison.html#SEC32">The <CODE>mfcalc</CODE> Symbol Table</A>
+</UL>
+<LI><A NAME="TOC33" HREF="bison.html#SEC33">Exercises</A>
+</UL>
+<LI><A NAME="TOC34" HREF="bison.html#SEC34">Bison Grammar Files</A>
+<UL>
+<LI><A NAME="TOC35" HREF="bison.html#SEC35">Outline of a Bison Grammar</A>
+<UL>
+<LI><A NAME="TOC36" HREF="bison.html#SEC36">The C Declarations Section</A>
+<LI><A NAME="TOC37" HREF="bison.html#SEC37">The Bison Declarations Section</A>
+<LI><A NAME="TOC38" HREF="bison.html#SEC38">The Grammar Rules Section</A>
+<LI><A NAME="TOC39" HREF="bison.html#SEC39">The Additional C Code Section</A>
+</UL>
+<LI><A NAME="TOC40" HREF="bison.html#SEC40">Symbols, Terminal and Nonterminal</A>
+<LI><A NAME="TOC41" HREF="bison.html#SEC41">Syntax of Grammar Rules</A>
+<LI><A NAME="TOC42" HREF="bison.html#SEC42">Recursive Rules</A>
+<LI><A NAME="TOC43" HREF="bison.html#SEC43">Defining Language Semantics</A>
+<UL>
+<LI><A NAME="TOC44" HREF="bison.html#SEC44">Data Types of Semantic Values</A>
+<LI><A NAME="TOC45" HREF="bison.html#SEC45">More Than One Value Type</A>
+<LI><A NAME="TOC46" HREF="bison.html#SEC46">Actions</A>
+<LI><A NAME="TOC47" HREF="bison.html#SEC47">Data Types of Values in Actions</A>
+<LI><A NAME="TOC48" HREF="bison.html#SEC48">Actions in Mid-Rule</A>
+</UL>
+<LI><A NAME="TOC49" HREF="bison.html#SEC49">Bison Declarations</A>
+<UL>
+<LI><A NAME="TOC50" HREF="bison.html#SEC50">Token Type Names</A>
+<LI><A NAME="TOC51" HREF="bison.html#SEC51">Operator Precedence</A>
+<LI><A NAME="TOC52" HREF="bison.html#SEC52">The Collection of Value Types</A>
+<LI><A NAME="TOC53" HREF="bison.html#SEC53">Nonterminal Symbols</A>
+<LI><A NAME="TOC54" HREF="bison.html#SEC54">Suppressing Conflict Warnings</A>
+<LI><A NAME="TOC55" HREF="bison.html#SEC55">The Start-Symbol</A>
+<LI><A NAME="TOC56" HREF="bison.html#SEC56">A Pure (Reentrant) Parser</A>
+<LI><A NAME="TOC57" HREF="bison.html#SEC57">Bison Declaration Summary</A>
+</UL>
+<LI><A NAME="TOC58" HREF="bison.html#SEC58">Multiple Parsers in the Same Program</A>
+</UL>
+<LI><A NAME="TOC59" HREF="bison.html#SEC59">Parser C-Language Interface</A>
+<UL>
+<LI><A NAME="TOC60" HREF="bison.html#SEC60">The Parser Function <CODE>yyparse</CODE></A>
+<LI><A NAME="TOC61" HREF="bison.html#SEC61">The Lexical Analyzer Function <CODE>yylex</CODE></A>
+<UL>
+<LI><A NAME="TOC62" HREF="bison.html#SEC62">Calling Convention for <CODE>yylex</CODE></A>
+<LI><A NAME="TOC63" HREF="bison.html#SEC63">Semantic Values of Tokens</A>
+<LI><A NAME="TOC64" HREF="bison.html#SEC64">Textual Positions of Tokens</A>
+<LI><A NAME="TOC65" HREF="bison.html#SEC65">Calling Conventions for Pure Parsers</A>
+</UL>
+<LI><A NAME="TOC66" HREF="bison.html#SEC66">The Error Reporting Function <CODE>yyerror</CODE></A>
+<LI><A NAME="TOC67" HREF="bison.html#SEC67">Special Features for Use in Actions</A>
+</UL>
+<LI><A NAME="TOC68" HREF="bison.html#SEC68">The Bison Parser Algorithm</A>
+<UL>
+<LI><A NAME="TOC69" HREF="bison.html#SEC69">Look-Ahead Tokens</A>
+<LI><A NAME="TOC70" HREF="bison.html#SEC70">Shift/Reduce Conflicts</A>
+<LI><A NAME="TOC71" HREF="bison.html#SEC71">Operator Precedence</A>
+<UL>
+<LI><A NAME="TOC72" HREF="bison.html#SEC72">When Precedence is Needed</A>
+<LI><A NAME="TOC73" HREF="bison.html#SEC73">Specifying Operator Precedence</A>
+<LI><A NAME="TOC74" HREF="bison.html#SEC74">Precedence Examples</A>
+<LI><A NAME="TOC75" HREF="bison.html#SEC75">How Precedence Works</A>
+</UL>
+<LI><A NAME="TOC76" HREF="bison.html#SEC76">Context-Dependent Precedence</A>
+<LI><A NAME="TOC77" HREF="bison.html#SEC77">Parser States</A>
+<LI><A NAME="TOC78" HREF="bison.html#SEC78">Reduce/Reduce Conflicts</A>
+<LI><A NAME="TOC79" HREF="bison.html#SEC79">Mysterious Reduce/Reduce Conflicts</A>
+<LI><A NAME="TOC80" HREF="bison.html#SEC80">Stack Overflow, and How to Avoid It</A>
+</UL>
+<LI><A NAME="TOC81" HREF="bison.html#SEC81">Error Recovery</A>
+<LI><A NAME="TOC82" HREF="bison.html#SEC82">Handling Context Dependencies</A>
+<UL>
+<LI><A NAME="TOC83" HREF="bison.html#SEC83">Semantic Info in Token Types</A>
+<LI><A NAME="TOC84" HREF="bison.html#SEC84">Lexical Tie-ins</A>
+<LI><A NAME="TOC85" HREF="bison.html#SEC85">Lexical Tie-ins and Error Recovery</A>
+</UL>
+<LI><A NAME="TOC86" HREF="bison.html#SEC86">Debugging Your Parser</A>
+<LI><A NAME="TOC87" HREF="bison.html#SEC87">Invoking Bison</A>
+<UL>
+<LI><A NAME="TOC88" HREF="bison.html#SEC88">Bison Options</A>
+<LI><A NAME="TOC89" HREF="bison.html#SEC89">Option Cross Key</A>
+<LI><A NAME="TOC90" HREF="bison.html#SEC90">Invoking Bison under VMS</A>
+</UL>
+<LI><A NAME="TOC91" HREF="bison.html#SEC91">Bison Symbols</A>
+<LI><A NAME="TOC92" HREF="bison.html#SEC92">Glossary</A>
+<LI><A NAME="TOC93" HREF="bison.html#SEC93">Index</A>
+</UL>
+<P><HR><P>
+<ul>
+<H1><A NAME="SEC1" HREF="bison.html#TOC1">Introduction</A></H1>
+<P>
+<A NAME="IDX1"></A>
+<EM>Bison</EM> is a general-purpose parser generator that converts a
+grammar description for an LALR(1) context-free grammar into a C
+program to parse that grammar.  Once you are proficient with Bison,
+you may use it to develop a wide range of language parsers, from those
+used in simple desk calculators to complex programming languages.
+<p>
+Bison is upward compatible with Yacc: all properly-written Yacc grammars
+ought to work with Bison with no change.  Anyone familiar with Yacc
+should be able to use Bison with little trouble.  You need to be fluent in
+C programming in order to use Bison or to understand this manual.
+<p>
+We begin with tutorial chapters that explain the basic concepts of using
+Bison and show three explained examples, each building on the last.  If you
+don't know Bison or Yacc, start by reading these chapters.  Reference
+chapters follow which describe specific aspects of Bison in detail.
+<p>
+Bison was written primarily by Robert Corbett; Richard Stallman made
+it Yacc-compatible.  This edition corresponds to version 1.24 of Bison.
+<p>
+<H1><A NAME="SEC2" HREF="bison.html#TOC2">Conditions for Using Bison</A></H1>
+<P>
+As of Bison version 1.24, we have changed the distribution terms for
+<CODE>yyparse</CODE> to permit using Bison's output in non-free programs.
+Formerly, Bison parsers could be used only in programs that were free
+software.
+<p>
+The other GNU programming tools, such as the GNU C compiler, have never
+had such a requirement.  They could always be used for non-free
+software.  The reason Bison was different was not due to a special
+policy decision; it resulted from applying the usual General Public
+License to all of the Bison source code.
+<p>
+The output of the Bison utility--the Bison parser file--contains a
+verbatim copy of a sizable piece of Bison, which is the code for the
+<CODE>yyparse</CODE> function.  (The actions from your grammar are inserted
+into this function at one point, but the rest of the function is not
+changed.)  When we applied the GPL terms to the code for <CODE>yyparse</CODE>,
+the effect was to restrict the use of Bison output to free software.
+<p>
+We didn't change the terms because of sympathy for people who want to
+make software proprietary.  <STRONG>Software should be free.</STRONG>  But we
+concluded that limiting Bison's use to free software was doing little to
+encourage people to make other software free.  So we decided to make the
+practical conditions for using Bison match the practical conditions for
+using the other GNU tools.
+<p>
+<H1><A NAME="SEC3" HREF="bison.html#TOC3">GNU GENERAL PUBLIC LICENSE</A></H1>
+<P>
+Version 2, June 1991
+<PRE>
+Copyright (C) 1989, 1991 Free Software Foundation, Inc.
+675 Mass Ave, Cambridge, MA 02139, USA
+<p>
+Everyone is permitted to copy and distribute verbatim copies
+of this license document, but changing it is not allowed.
+</PRE>
+<P>
+<H2><A NAME="SEC4" HREF="bison.html#TOC4">Preamble</A></H2>
+<P>
+  The licenses for most software are designed to take away your
+freedom to share and change it.  By contrast, the GNU General Public
+License is intended to guarantee your freedom to share and change free
+software--to make sure the software is free for all its users.  This
+General Public License applies to most of the Free Software
+Foundation's software and to any other program whose authors commit to
+using it.  (Some other Free Software Foundation software is covered by
+the GNU Library General Public License instead.)  You can apply it to
+your programs, too.
+<p>
+  When we speak of free software, we are referring to freedom, not
+price.  Our General Public Licenses are designed to make sure that you
+have the freedom to distribute copies of free software (and charge for
+this service if you wish), that you receive source code or can get it
+if you want it, that you can change the software or use pieces of it
+in new free programs; and that you know you can do these things.
+<p>
+  To protect your rights, we need to make restrictions that forbid
+anyone to deny you these rights or to ask you to surrender the rights.
+These restrictions translate to certain responsibilities for you if you
+distribute copies of the software, or if you modify it.
+<p>
+  For example, if you distribute copies of such a program, whether
+gratis or for a fee, you must give the recipients all the rights that
+you have.  You must make sure that they, too, receive or can get the
+source code.  And you must show them these terms so they know their
+rights.
+<p>
+  We protect your rights with two steps: (1) copyright the software, and
+(2) offer you this license which gives you legal permission to copy,
+distribute and/or modify the software.
+<p>
+  Also, for each author's protection and ours, we want to make certain
+that everyone understands that there is no warranty for this free
+software.  If the software is modified by someone else and passed on, we
+want its recipients to know that what they have is not the original, so
+that any problems introduced by others will not reflect on the original
+authors' reputations.
+<p>
+  Finally, any free program is threatened constantly by software
+patents.  We wish to avoid the danger that redistributors of a free
+program will individually obtain patent licenses, in effect making the
+program proprietary.  To prevent this, we have made it clear that any
+patent must be licensed for everyone's free use or not licensed at all.
+<p>
+  The precise terms and conditions for copying, distribution and
+modification follow.
+<p>
+<H2><A NAME="SEC5" HREF="bison.html#TOC5">TERMS AND CONDITIONS FOR COPYING, DISTRIBUTION AND MODIFICATION</A></H2>
+<P>
+<OL>
+<LI>
+This License applies to any program or other work which contains
+a notice placed by the copyright holder saying it may be distributed
+under the terms of this General Public License.  The "Program", below,
+refers to any such program or work, and a "work based on the Program"
+means either the Program or any derivative work under copyright law:
+that is to say, a work containing the Program or a portion of it,
+either verbatim or with modifications and/or translated into another
+language.  (Hereinafter, translation is included without limitation in
+the term "modification".)  Each licensee is addressed as "you".
+<p>
+Activities other than copying, distribution and modification are not
+covered by this License; they are outside its scope.  The act of
+running the Program is not restricted, and the output from the Program
+is covered only if its contents constitute a work based on the
+Program (independent of having been made by running the Program).
+Whether that is true depends on what the Program does.
+<p>
+<LI>
+You may copy and distribute verbatim copies of the Program's
+source code as you receive it, in any medium, provided that you
+conspicuously and appropriately publish on each copy an appropriate
+copyright notice and disclaimer of warranty; keep intact all the
+notices that refer to this License and to the absence of any warranty;
+and give any other recipients of the Program a copy of this License
+along with the Program.
+<p>
+You may charge a fee for the physical act of transferring a copy, and
+you may at your option offer warranty protection in exchange for a fee.
+<p>
+<LI>
+You may modify your copy or copies of the Program or any portion
+of it, thus forming a work based on the Program, and copy and
+distribute such modifications or work under the terms of Section 1
+above, provided that you also meet all of these conditions:
+<p>
+<OL>
+<LI>
+You must cause the modified files to carry prominent notices
+stating that you changed the files and the date of any change.
+<p>
+<LI>
+You must cause any work that you distribute or publish, that in
+whole or in part contains or is derived from the Program or any
+part thereof, to be licensed as a whole at no charge to all third
+parties under the terms of this License.
+<p>
+<LI>
+If the modified program normally reads commands interactively
+when run, you must cause it, when started running for such
+interactive use in the most ordinary way, to print or display an
+announcement including an appropriate copyright notice and a
+notice that there is no warranty (or else, saying that you provide
+a warranty) and that users may redistribute the program under
+these conditions, and telling the user how to view a copy of this
+License.  (Exception: if the Program itself is interactive but
+does not normally print such an announcement, your work based on
+the Program is not required to print an announcement.)
+<p>
+</OL>
+These requirements apply to the modified work as a whole.  If
+identifiable sections of that work are not derived from the Program,
+and can be reasonably considered independent and separate works in
+themselves, then this License, and its terms, do not apply to those
+sections when you distribute them as separate works.  But when you
+distribute the same sections as part of a whole which is a work based
+on the Program, the distribution of the whole must be on the terms of
+this License, whose permissions for other licensees extend to the
+entire whole, and thus to each and every part regardless of who wrote it.
+<p>
+Thus, it is not the intent of this section to claim rights or contest
+your rights to work written entirely by you; rather, the intent is to
+exercise the right to control the distribution of derivative or
+collective works based on the Program.
+<p>
+In addition, mere aggregation of another work not based on the Program
+with the Program (or with a work based on the Program) on a volume of
+a storage or distribution medium does not bring the other work under
+the scope of this License.
+<p>
+<LI>
+You may copy and distribute the Program (or a work based on it,
+under Section 2) in object code or executable form under the terms of
+Sections 1 and 2 above provided that you also do one of the following:
+<p>
+<OL>
+<LI>
+Accompany it with the complete corresponding machine-readable
+source code, which must be distributed under the terms of Sections
+1 and 2 above on a medium customarily used for software interchange; or,
+<p>
+<LI>
+Accompany it with a written offer, valid for at least three
+years, to give any third party, for a charge no more than your
+cost of physically performing source distribution, a complete
+machine-readable copy of the corresponding source code, to be
+distributed under the terms of Sections 1 and 2 above on a medium
+customarily used for software interchange; or,
+<p>
+<LI>
+Accompany it with the information you received as to the offer
+to distribute corresponding source code.  (This alternative is
+allowed only for noncommercial distribution and only if you
+received the program in object code or executable form with such
+an offer, in accord with Subsection b above.)
+<p>
+</OL>
+The source code for a work means the preferred form of the work for
+making modifications to it.  For an executable work, complete source
+code means all the source code for all modules it contains, plus any
+associated interface definition files, plus the scripts used to
+control compilation and installation of the executable.  However, as a
+special exception, the source code distributed need not include
+anything that is normally distributed (in either source or binary
+form) with the major components (compiler, kernel, and so on) of the
+operating system on which the executable runs, unless that component
+itself accompanies the executable.
+<p>
+If distribution of executable or object code is made by offering
+access to copy from a designated place, then offering equivalent
+access to copy the source code from the same place counts as
+distribution of the source code, even though third parties are not
+compelled to copy the source along with the object code.
+<p>
+<LI>
+You may not copy, modify, sublicense, or distribute the Program
+except as expressly provided under this License.  Any attempt
+otherwise to copy, modify, sublicense or distribute the Program is
+void, and will automatically terminate your rights under this License.
+However, parties who have received copies, or rights, from you under
+this License will not have their licenses terminated so long as such
+parties remain in full compliance.
+<p>
+<LI>
+You are not required to accept this License, since you have not
+signed it.  However, nothing else grants you permission to modify or
+distribute the Program or its derivative works.  These actions are
+prohibited by law if you do not accept this License.  Therefore, by
+modifying or distributing the Program (or any work based on the
+Program), you indicate your acceptance of this License to do so, and
+all its terms and conditions for copying, distributing or modifying
+the Program or works based on it.
+<p>
+<LI>
+Each time you redistribute the Program (or any work based on the
+Program), the recipient automatically receives a license from the
+original licensor to copy, distribute or modify the Program subject to
+these terms and conditions.  You may not impose any further
+restrictions on the recipients' exercise of the rights granted herein.
+You are not responsible for enforcing compliance by third parties to
+this License.
+<p>
+<LI>
+If, as a consequence of a court judgment or allegation of patent
+infringement or for any other reason (not limited to patent issues),
+conditions are imposed on you (whether by court order, agreement or
+otherwise) that contradict the conditions of this License, they do not
+excuse you from the conditions of this License.  If you cannot
+distribute so as to satisfy simultaneously your obligations under this
+License and any other pertinent obligations, then as a consequence you
+may not distribute the Program at all.  For example, if a patent
+license would not permit royalty-free redistribution of the Program by
+all those who receive copies directly or indirectly through you, then
+the only way you could satisfy both it and this License would be to
+refrain entirely from distribution of the Program.
+<p>
+If any portion of this section is held invalid or unenforceable under
+any particular circumstance, the balance of the section is intended to
+apply and the section as a whole is intended to apply in other
+circumstances.
+<p>
+It is not the purpose of this section to induce you to infringe any
+patents or other property right claims or to contest validity of any
+such claims; this section has the sole purpose of protecting the
+integrity of the free software distribution system, which is
+implemented by public license practices.  Many people have made
+generous contributions to the wide range of software distributed
+through that system in reliance on consistent application of that
+system; it is up to the author/donor to decide if he or she is willing
+to distribute software through any other system and a licensee cannot
+impose that choice.
+<p>
+This section is intended to make thoroughly clear what is believed to
+be a consequence of the rest of this License.
+<p>
+<LI>
+If the distribution and/or use of the Program is restricted in
+certain countries either by patents or by copyrighted interfaces, the
+original copyright holder who places the Program under this License
+may add an explicit geographical distribution limitation excluding
+those countries, so that distribution is permitted only in or among
+countries not thus excluded.  In such case, this License incorporates
+the limitation as if written in the body of this License.
+<p>
+<LI>
+The Free Software Foundation may publish revised and/or new versions
+of the General Public License from time to time.  Such new versions will
+be similar in spirit to the present version, but may differ in detail to
+address new problems or concerns.
+<p>
+Each version is given a distinguishing version number.  If the Program
+specifies a version number of this License which applies to it and "any
+later version", you have the option of following the terms and conditions
+either of that version or of any later version published by the Free
+Software Foundation.  If the Program does not specify a version number of
+this License, you may choose any version ever published by the Free Software
+Foundation.
+<p>
+<LI>
+If you wish to incorporate parts of the Program into other free
+programs whose distribution conditions are different, write to the author
+to ask for permission.  For software which is copyrighted by the Free
+Software Foundation, write to the Free Software Foundation; we sometimes
+make exceptions for this.  Our decision will be guided by the two goals
+of preserving the free status of all derivatives of our free software and
+of promoting the sharing and reuse of software generally.
+<p>
+<P><STRONG>NO WARRANTY</STRONG></P>
+<LI>
+BECAUSE THE PROGRAM IS LICENSED FREE OF CHARGE, THERE IS NO WARRANTY
+FOR THE PROGRAM, TO THE EXTENT PERMITTED BY APPLICABLE LAW.  EXCEPT WHEN
+OTHERWISE STATED IN WRITING THE COPYRIGHT HOLDERS AND/OR OTHER PARTIES
+PROVIDE THE PROGRAM "AS IS" WITHOUT WARRANTY OF ANY KIND, EITHER EXPRESSED
+OR IMPLIED, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF
+MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE.  THE ENTIRE RISK AS
+TO THE QUALITY AND PERFORMANCE OF THE PROGRAM IS WITH YOU.  SHOULD THE
+PROGRAM PROVE DEFECTIVE, YOU ASSUME THE COST OF ALL NECESSARY SERVICING,
+REPAIR OR CORRECTION.
+<p>
+<LI>
+IN NO EVENT UNLESS REQUIRED BY APPLICABLE LAW OR AGREED TO IN WRITING
+WILL ANY COPYRIGHT HOLDER, OR ANY OTHER PARTY WHO MAY MODIFY AND/OR
+REDISTRIBUTE THE PROGRAM AS PERMITTED ABOVE, BE LIABLE TO YOU FOR DAMAGES,
+INCLUDING ANY GENERAL, SPECIAL, INCIDENTAL OR CONSEQUENTIAL DAMAGES ARISING
+OUT OF THE USE OR INABILITY TO USE THE PROGRAM (INCLUDING BUT NOT LIMITED
+TO LOSS OF DATA OR DATA BEING RENDERED INACCURATE OR LOSSES SUSTAINED BY
+YOU OR THIRD PARTIES OR A FAILURE OF THE PROGRAM TO OPERATE WITH ANY OTHER
+PROGRAMS), EVEN IF SUCH HOLDER OR OTHER PARTY HAS BEEN ADVISED OF THE
+POSSIBILITY OF SUCH DAMAGES.
+<p>
+</OL>
+<P>
+<P><STRONG>END OF TERMS AND CONDITIONS</STRONG></P>
+<p>
+<H2><A NAME="SEC6" HREF="bison.html#TOC6">How to Apply These Terms to Your New Programs</A></H2>
+<P>
+  If you develop a new program, and you want it to be of the greatest
+possible use to the public, the best way to achieve this is to make it
+free software which everyone can redistribute and change under these terms.
+<p>
+  To do so, attach the following notices to the program.  It is safest
+to attach them to the start of each source file to most effectively
+convey the exclusion of warranty; and each file should have at least
+the "copyright" line and a pointer to where the full notice is found.
+<p>
+<ul><pre>
+<VAR>one line to give the program's name and a brief idea of what it does.</VAR>
+Copyright (C) 19<VAR>yy</VAR>  <VAR>name of author</VAR>
+<p>
+This program is free software; you can redistribute it and/or modify
+it under the terms of the GNU General Public License as published by
+the Free Software Foundation; either version 2 of the License, or
+(at your option) any later version.
+<p>
+This program is distributed in the hope that it will be useful,
+but WITHOUT ANY WARRANTY; without even the implied warranty of
+MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+GNU General Public License for more details.
+<p>
+You should have received a copy of the GNU General Public License
+along with this program; if not, write to the Free Software
+Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA.
+</PRE>
+</ul>
+<P>
+Also add information on how to contact you by electronic and paper mail.
+If the program is interactive, make it output a short notice like this
+when it starts in an interactive mode:
+<ul>
+<PRE>
+Gnomovision version 69, Copyright (C) 19<VAR>yy</VAR> <VAR>name of author</VAR>
+Gnomovision comes with ABSOLUTELY NO WARRANTY; for details 
+type `show w'.
+This is free software, and you are welcome to redistribute it
+under certain conditions; type `show c' for details.
+</PRE>
+</ul>
+<P>
+The hypothetical commands <SAMP>`show w'</SAMP> and <SAMP>`show c'</SAMP> should show
+the appropriate parts of the General Public License.  Of course, the
+commands you use may be called something other than <SAMP>`show w'</SAMP> and
+<SAMP>`show c'</SAMP>; they could even be mouse-clicks or menu items--whatever
+suits your program.
+<p>
+You should also get your employer (if you work as a programmer) or your
+school, if any, to sign a "copyright disclaimer" for the program, if
+necessary.  Here is a sample; alter the names:
+<p>
+<ul>
+<PRE>
+Yoyodyne, Inc., hereby disclaims all copyright interest in the program
+`Gnomovision' (which makes passes at compilers) written by James Hacker.
+<p>
+<VAR>signature of Ty Coon</VAR>, 1 April 1989
+Ty Coon, President of Vice
+</PRE>
+</ul>
+<P>
+This General Public License does not permit incorporating your program into
+proprietary programs.  If your program is a subroutine library, you may
+consider it more useful to permit linking proprietary applications with the
+library.  If this is what you want to do, use the GNU Library General
+Public License instead of this License.
+<p>
+<H1><A NAME="SEC7" HREF="bison.html#TOC7">The Concepts of Bison</A></H1>
+<P>
+This chapter introduces many of the basic concepts without which the
+details of Bison will not make sense.  If you do not already know how to
+use Bison or Yacc, we suggest you start by reading this chapter carefully.
+<H2><A NAME="SEC8" HREF="bison.html#TOC8">Languages and Context-Free Grammars</A></H2>
+<P>
+<A NAME="IDX2"></A>
+<A NAME="IDX3"></A>
+<BOL>In order for Bison to parse a language, it must be described by a
+<EM>context-free grammar</EM>.  This means that you specify one or more
+<EM>syntactic groupings</EM> and give rules for constructing them from their
+parts.  For example, in the C language, one kind of grouping is called an
+`expression'.  One rule for making an expression might be, "An expression
+can be made of a minus sign and another expression".  Another would be,
+"An expression can be an integer".  As you can see, rules are often
+recursive, but there must be at least one rule which leads out of the
+recursion.
+<p>
+<A NAME="IDX4"></A>
+<A NAME="IDX5"></A>
+The most common formal system for presenting such rules for humans to read
+is <EM>Backus-Naur Form</EM> or "BNF", which was developed in order to
+specify the language Algol 60.  Any grammar expressed in BNF is a
+context-free grammar.  The input to Bison is essentially machine-readable
+BNF.
+<p>
+Not all context-free languages can be handled by Bison, only those
+that are LALR(1).  In brief, this means that it must be possible to
+tell how to parse any portion of an input string with just a single
+token of look-ahead.  Strictly speaking, that is a description of an
+LR(1) grammar, and LALR(1) involves additional restrictions that are
+hard to explain simply; but it is rare in actual practice to find an
+LR(1) grammar that fails to be LALR(1).  See section <A HREF="bison.html#SEC79">Mysterious Reduce/Reduce Conflicts</A>, for more information on this.
+<p>
+<A NAME="IDX6"></A>
+<A NAME="IDX7"></A>
+<A NAME="IDX8"></A>
+<A NAME="IDX9"></A>
+In the formal grammatical rules for a language, each kind of syntactic unit
+or grouping is named by a <EM>symbol</EM>.  Those which are built by grouping
+smaller constructs according to grammatical rules are called
+<EM>nonterminal symbols</EM>; those which can't be subdivided are called
+<EM>terminal symbols</EM> or <EM>token types</EM>.  We call a piece of input
+corresponding to a single terminal symbol a <EM>token</EM>, and a piece
+corresponding to a single nonterminal symbol a <EM>grouping</EM>.
+We can use the C language as an example of what symbols, terminal and
+nonterminal, mean.  The tokens of C are identifiers, constants (numeric and
+string), and the various keywords, arithmetic operators and punctuation
+marks.  So the terminal symbols of a grammar for C include `identifier',
+`number', `string', plus one symbol for each keyword, operator or
+punctuation mark: `if', `return', `const', `static', `int', `char',
+`plus-sign', `open-brace', `close-brace', `comma' and many more.  (These
+tokens can be subdivided into characters, but that is a matter of
+lexicography, not grammar.)
+<p>
+Here is a simple C function subdivided into tokens:
+<p>
+<BLOCKQUOTE>
+<PRE>
+int             /* keyword `int' */
+square (x)      /* identifier, open-paren, */
+                /* identifier, close-paren */
+     int x;     /* keyword `int', identifier, semicolon */
+{               /* open-brace */
+  return x * x; /* keyword `return', identifier, */
+                /* asterisk, identifier, semicolon */
+}               /* close-brace */
+</PRE>
+</BLOCKQUOTE>
+<P>
+The syntactic groupings of C include the expression, the statement, the
+declaration, and the function definition.  These are represented in the
+grammar of C by nonterminal symbols `expression', `statement',
+`declaration' and `function definition'.  The full grammar uses dozens of
+additional language constructs, each with its own nonterminal symbol, in
+order to express the meanings of these four.  The example above is a
+function definition; it contains one declaration, and one statement.  In
+the statement, each <SAMP>`x'</SAMP> is an expression and so is <SAMP>`x * x'</SAMP>.
+Each nonterminal symbol must have grammatical rules showing how it is made
+out of simpler constructs.  For example, one kind of C statement is the
+<CODE>return</CODE> statement; this would be described with a grammar rule which
+reads informally as follows:
+<BLOCKQUOTE>
+<P>
+A `statement' can be made of a `return' keyword, an `expression' and a
+`semicolon'.
+</BLOCKQUOTE>
+<P>
+There would be many other rules for `statement', one for each kind of
+statement in C.
+<p>
+<A NAME="IDX10"></A>
+One nonterminal symbol must be distinguished as the special one which
+defines a complete utterance in the language.  It is called the <EM>start
+symbol</EM>.  In a compiler, this means a complete input program.  In the C
+language, the nonterminal symbol `sequence of definitions and declarations'
+plays this role.
+<p>
+For example, <SAMP>`1 + 2'</SAMP> is a valid C expression--a valid part of a C
+program--but it is not valid as an <EM>entire</EM> C program.  In the
+context-free grammar of C, this follows from the fact that `expression' is
+not the start symbol.
+<p>
+The Bison parser reads a sequence of tokens as its input, and groups the
+tokens using the grammar rules.  If the input is valid, the end result is
+that the entire token sequence reduces to a single grouping whose symbol is
+the grammar's start symbol.  If we use a grammar for C, the entire input
+must be a `sequence of definitions and declarations'.  If not, the parser
+reports a syntax error.
+<p>
+<H2><A NAME="SEC9" HREF="bison.html#TOC9">From Formal Rules to Bison Input</A></H2>
+<P>
+<A NAME="IDX11"></A>
+<A NAME="IDX12"></A>
+<A NAME="IDX13"></A>
+A formal grammar is a mathematical construct.  To define the language
+for Bison, you must write a file expressing the grammar in Bison syntax:
+a <EM>Bison grammar</EM> file.  See section <A HREF="bison.html#SEC34">Bison Grammar Files</A>.
+A nonterminal symbol in the formal grammar is represented in Bison input
+as an identifier, like an identifier in C.  By convention, it should be
+in lower case, such as <CODE>expr</CODE>, <CODE>stmt</CODE> or <CODE>declaration</CODE>.
+The Bison representation for a terminal symbol is also called a <EM>token
+type</EM>.  Token types as well can be represented as C-like identifiers.  By
+convention, these identifiers should be upper case to distinguish them from
+nonterminals: for example, <CODE>INTEGER</CODE>, <CODE>IDENTIFIER</CODE>, <CODE>IF</CODE> or
+<CODE>RETURN</CODE>.  A terminal symbol that stands for a particular keyword in
+the language should be named after that keyword converted to upper case.
+The terminal symbol <CODE>error</CODE> is reserved for error recovery.
+<p>
+See section <A HREF="bison.html#SEC40">Symbols, Terminal and Nonterminal</A>.
+A terminal symbol can also be represented as a character literal, just like
+a C character constant.  You should do this whenever a token is just a
+single character (parenthesis, plus-sign, etc.): use that same character in
+a literal as the terminal symbol for that token.
+<p>
+The grammar rules also have an expression in Bison syntax.  For example,
+here is the Bison rule for a C <CODE>return</CODE> statement.  The semicolon in
+quotes is a literal character token, representing part of the C syntax for
+the statement; the naked semicolon, and the colon, are Bison punctuation
+used in every rule.
+<p>
+<BLOCKQUOTE>
+<PRE>
+stmt:   RETURN expr ';'
+        ;
+</PRE>
+</BLOCKQUOTE>
+<P>
+See section <A HREF="bison.html#SEC41">Syntax of Grammar Rules</A>.
+<p>
+<H2><A NAME="SEC10" HREF="bison.html#TOC10">Semantic Values</A></H2>
+<P>
+<A NAME="IDX14"></A>
+<A NAME="IDX15"></A>
+A formal grammar selects tokens only by their classifications: for example,
+if a rule mentions the terminal symbol `integer constant', it means that
+<EM>any</EM> integer constant is grammatically valid in that position.  The
+precise value of the constant is irrelevant to how to parse the input: if
+<SAMP>`x+4'</SAMP> is grammatical then <SAMP>`x+1'</SAMP> or <SAMP>`x+3989'</SAMP> is equally
+grammatical.
+<p>
+But the precise value is very important for what the input means once it is
+parsed.  A compiler is useless if it fails to distinguish between 4, 1 and
+3989 as constants in the program!  Therefore, each token in a Bison grammar
+has both a token type and a <EM>semantic value</EM>.  See section <A HREF="bison.html#SEC43">Defining Language Semantics</A>,
+for details.
+<p>
+The token type is a terminal symbol defined in the grammar, such as
+<CODE>INTEGER</CODE>, <CODE>IDENTIFIER</CODE> or <CODE>','</CODE>.  It tells everything
+you need to know to decide where the token may validly appear and how to
+group it with other tokens.  The grammar rules know nothing about tokens
+except their types.
+<p>
+The semantic value has all the rest of the information about the
+meaning of the token, such as the value of an integer, or the name of an
+identifier.  (A token such as <CODE>','</CODE> which is just punctuation doesn't
+need to have any semantic value.)
+<p>
+For example, an input token might be classified as token type
+<CODE>INTEGER</CODE> and have the semantic value 4.  Another input token might
+have the same token type <CODE>INTEGER</CODE> but value 3989.  When a grammar
+rule says that <CODE>INTEGER</CODE> is allowed, either of these tokens is
+acceptable because each is an <CODE>INTEGER</CODE>.  When the parser accepts the
+token, it keeps track of the token's semantic value.
+<p>
+Each grouping can also have a semantic value as well as its nonterminal
+symbol.  For example, in a calculator, an expression typically has a
+semantic value that is a number.  In a compiler for a programming
+language, an expression typically has a semantic value that is a tree
+structure describing the meaning of the expression.
+<p>
+<H2><A NAME="SEC11" HREF="bison.html#TOC11">Semantic Actions</A></H2>
+<P>
+<A NAME="IDX16"></A>
+<A NAME="IDX17"></A>
+In order to be useful, a program must do more than parse input; it must
+also produce some output based on the input.  In a Bison grammar, a grammar
+rule can have an <EM>action</EM> made up of C statements.  Each time the
+parser recognizes a match for that rule, the action is executed.
+See section <A HREF="bison.html#SEC46">Actions</A>.
+<p>
+Most of the time, the purpose of an action is to compute the semantic value
+of the whole construct from the semantic values of its parts.  For example,
+suppose we have a rule which says an expression can be the sum of two
+expressions.  When the parser recognizes such a sum, each of the
+subexpressions has a semantic value which describes how it was built up.
+The action for this rule should create a similar sort of value for the
+newly recognized larger expression.
+For example, here is a rule that says an expression can be the sum of
+two subexpressions:
+<p>
+<BLOCKQUOTE>
+<PRE>
+expr: expr '+' expr   { $$ = $1 + $3; }
+        ;
+</PRE>
+</BLOCKQUOTE>
+<P>
+The action says how to produce the semantic value of the sum expression
+from the values of the two subexpressions.
+<H2><A NAME="SEC12" HREF="bison.html#TOC12">Bison Output: the Parser File</A></H2>
+<P>
+<A NAME="IDX18"></A>
+<A NAME="IDX19"></A>
+<A NAME="IDX20"></A>
+<A NAME="IDX21"></A>
+When you run Bison, you give it a Bison grammar file as input.  The output
+is a C source file that parses the language described by the grammar.
+This file is called a <EM>Bison parser</EM>.  Keep in mind that the Bison
+utility and the Bison parser are two distinct programs: the Bison utility
+is a program whose output is the Bison parser that becomes part of your
+program.
+<p>
+The job of the Bison parser is to group tokens into groupings according to
+the grammar rules--for example, to build identifiers and operators into
+expressions.  As it does this, it runs the actions for the grammar rules it
+uses.
+<p>
+The tokens come from a function called the <EM>lexical analyzer</EM> that you
+must supply in some fashion (such as by writing it in C).  The Bison parser
+calls the lexical analyzer each time it wants a new token.  It doesn't know
+what is "inside" the tokens (though their semantic values may reflect
+this).  Typically the lexical analyzer makes the tokens by parsing
+characters of text, but Bison does not depend on this.  See section <A HREF="bison.html#SEC61">The Lexical Analyzer Function <CODE>yylex</CODE></A>.
+The Bison parser file is C code which defines a function named
+<CODE>yyparse</CODE> which implements that grammar.  This function does not make
+a complete C program: you must supply some additional functions.  One is
+the lexical analyzer.  Another is an error-reporting function which the
+parser calls to report an error.  In addition, a complete C program must
+start with a function called <CODE>main</CODE>; you have to provide this, and
+arrange for it to call <CODE>yyparse</CODE> or the parser will never run.
+See section <A HREF="bison.html#SEC59">Parser C-Language Interface</A>.
+Aside from the token type names and the symbols in the actions you
+write, all variable and function names used in the Bison parser file
+begin with <SAMP>`yy'</SAMP> or <SAMP>`YY'</SAMP>.  This includes interface functions
+such as the lexical analyzer function <CODE>yylex</CODE>, the error reporting
+function <CODE>yyerror</CODE> and the parser function <CODE>yyparse</CODE> itself.
+This also includes numerous identifiers used for internal purposes.
+Therefore, you should avoid using C identifiers starting with <SAMP>`yy'</SAMP>
+or <SAMP>`YY'</SAMP> in the Bison grammar file except for the ones defined in
+this manual.
+<H2><A NAME="SEC13" HREF="bison.html#TOC13">Stages in Using Bison</A></H2>
+<P>
+<A NAME="IDX22"></A>
+<A NAME="IDX23"></A>
+The actual language-design process using Bison, from grammar specification
+to a working compiler or interpreter, has these parts:
+<OL>
+<LI>
+Formally specify the grammar in a form recognized by Bison
+(see section <A HREF="bison.html#SEC34">Bison Grammar Files</A>).  For each grammatical rule in the language,
+describe the action that is to be taken when an instance of that rule
+is recognized.  The action is described by a sequence of C statements.
+<LI>
+Write a lexical analyzer to process input and pass tokens to the
+parser.  The lexical analyzer may be written by hand in C
+(see section <A HREF="bison.html#SEC61">The Lexical Analyzer Function <CODE>yylex</CODE></A>).  It could also be produced using Lex, but the use
+of Lex is not discussed in this manual.
+<LI>
+Write a controlling function that calls the Bison-produced parser.
+<LI>
+Write error-reporting routines.
+</OL>
+<P>
+To turn this source code as written into a runnable program, you
+must follow these steps:
+<OL>
+<LI>
+Run Bison on the grammar to produce the parser.
+<LI>
+Compile the code output by Bison, as well as any other source files.
+<LI>
+Link the object files to produce the finished product.
+</OL>
+<P>
+<H2><A NAME="SEC14" HREF="bison.html#TOC14">The Overall Layout of a Bison Grammar</A></H2>
+<P>
+<A NAME="IDX24"></A>
+<A NAME="IDX25"></A>
+<A NAME="IDX26"></A>
+<A NAME="IDX27"></A>
+The input file for the Bison utility is a <EM>Bison grammar file</EM>.  The
+general form of a Bison grammar file is as follows:
+<PRE>
+%{
+<VAR>C declarations</VAR>
+%}
+<VAR>Bison declarations</VAR>
+%%
+<VAR>Grammar rules</VAR>
+%%
+<VAR>Additional C code</VAR>
+</PRE>
+<P>
+The <SAMP>`%%'</SAMP>, <SAMP>`%{'</SAMP> and <SAMP>`%}'</SAMP> are punctuation that appears
+in every Bison grammar file to separate the sections.
+The C declarations may define types and variables used in the actions.
+You can also use preprocessor commands to define macros used there, and use
+<CODE>#include</CODE> to include header files that do any of these things.
+The Bison declarations declare the names of the terminal and nonterminal
+symbols, and may also describe operator precedence and the data types of
+semantic values of various symbols.
+<P>
+The grammar rules define how to construct each nonterminal symbol from its
+parts.
+<P>
+The additional C code can contain any C code you want to use.  Often the
+definition of the lexical analyzer <CODE>yylex</CODE> goes here, plus subroutines
+called by the actions in the grammar rules.  In a simple program, all the
+rest of the program can go here.
+<P>
+<H1><A NAME="SEC15" HREF="bison.html#TOC15">Examples</A></H1>
+<P>
+<A NAME="IDX28"></A>
+<A NAME="IDX29"></A>
+Now we show and explain three sample programs written using Bison: a
+reverse polish notation calculator, an algebraic (infix) notation
+calculator, and a multi-function calculator.  All three have been tested
+under BSD Unix 4.3; each produces a usable, though limited, interactive
+desk-top calculator.
+<P>
+These examples are simple, but Bison grammars for real programming
+languages are written the same way.
+<P>
+<H2><A NAME="SEC16" HREF="bison.html#TOC16">Reverse Polish Notation Calculator</A></H2>
+<P>
+<A NAME="IDX30"></A>
+<A NAME="IDX31"></A>
+<A NAME="IDX32"></A>
+<A NAME="IDX33"></A>
+The first example is that of a simple double-precision <EM>reverse polish
+notation</EM> calculator (a calculator using postfix operators).  This example
+provides a good starting point, since operator precedence is not an issue.
+<P>
+The second example will illustrate how operator precedence is handled.
+The source code for this calculator is named <TT>`rpcalc.y'</TT>.  The
+<SAMP>`.y'</SAMP> extension is a convention used for Bison input files.
+<H3><A NAME="SEC17" HREF="bison.html#TOC17">Declarations for <CODE>rpcalc</CODE></A></H3>
+<P>
+Here are the C and Bison declarations for the reverse polish notation
+calculator.  As in C, comments are placed between <SAMP>`/*...*/'</SAMP>.
+<P>
+<PRE>
+/* Reverse polish notation calculator. */
+%{
+#define YYSTYPE double
+#include &#60;math.h&#62;
+%}
+%token NUM
+%% /* Grammar rules and actions follow */
+</PRE>
+<P>
+The C declarations section (see section <A HREF="bison.html#SEC36">The C Declarations Section</A>) contains two
+preprocessor directives.
+<P>
+The <CODE>#define</CODE> directive defines the macro <CODE>YYSTYPE</CODE>, thus
+specifying the C data type for semantic values of both tokens and groupings
+(see section <A HREF="bison.html#SEC44">Data Types of Semantic Values</A>).  The Bison parser will use whatever type
+<CODE>YYSTYPE</CODE> is defined as; if you don't define it, <CODE>int</CODE> is the
+default.  Because we specify <CODE>double</CODE>, each token and each expression
+has an associated value, which is a floating point number.
+<P>
+The <CODE>#include</CODE> directive is used to declare the exponentiation
+function <CODE>pow</CODE>.
+<P>
+The second section, Bison declarations, provides information to Bison about
+the token types (see section <A HREF="bison.html#SEC37">The Bison Declarations Section</A>).  Each terminal symbol that is
+not a single-character literal must be declared here.  (Single-character
+literals normally don't need to be declared.)  In this example, all the
+arithmetic operators are designated by single-character literals, so the
+only terminal symbol that needs to be declared is <CODE>NUM</CODE>, the token
+type for numeric constants.
+<P>
+<H3><A NAME="SEC18" HREF="bison.html#TOC18">Grammar Rules for <CODE>rpcalc</CODE></A></H3>
+<P>
+Here are the grammar rules for the reverse polish notation calculator.
+<P>
+<BLOCKQUOTE>
+<PRE>
+input:    /* empty */
+        | input line
+;
+line:     '\n'
+        | exp '\n'  { printf ("\t%.10g\n", $1); }
+;
+exp:      NUM             { $$ = $1;         }
+        | exp exp '+'     { $$ = $1 + $2;    }
+        | exp exp '-'     { $$ = $1 - $2;    }
+        | exp exp '*'     { $$ = $1 * $2;    }
+        | exp exp '/'     { $$ = $1 / $2;    }
+      /* Exponentiation */
+        | exp exp '^'     { $$ = pow ($1, $2); }
+      /* Unary minus    */
+        | exp 'n'         { $$ = -$1;        }
+;
+%%
+</PRE>
+</BLOCKQUOTE>
+<P>
+The groupings of the rpcalc "language" defined here are the expression
+(given the name <CODE>exp</CODE>), the line of input (<CODE>line</CODE>), and the
+complete input transcript (<CODE>input</CODE>).  Each of these nonterminal
+symbols has several alternate rules, joined by the <SAMP>`|'</SAMP> punctuator
+which is read as "or".  The following sections explain what these rules
+mean.
+<P>
+The semantics of the language is determined by the actions taken when a
+grouping is recognized.  The actions are the C code that appears inside
+braces.  See section <A HREF="bison.html#SEC46">Actions</A>.
+<P>
+You must specify these actions in C, but Bison provides the means for
+passing semantic values between the rules.  In each action, the
+pseudo-variable <CODE>$$</CODE> stands for the semantic value for the grouping
+that the rule is going to construct.  Assigning a value to <CODE>$$</CODE> is the
+main job of most actions.  The semantic values of the components of the
+rule are referred to as <CODE>$1</CODE>, <CODE>$2</CODE>, and so on.
+<P>
+<H4><A NAME="SEC19" HREF="bison.html#TOC19">Explanation of <CODE>input</CODE></A></H4>
+<P>
+Consider the definition of <CODE>input</CODE>:
+<P>
+<BLOCKQUOTE>
+<PRE>
+input:    /* empty */
+        | input line
+;
+</PRE>
+</BLOCKQUOTE>
+<P>
+This definition reads as follows: "A complete input is either an empty
+string, or a complete input followed by an input line".  Notice that
+"complete input" is defined in terms of itself.  This definition is said
+to be <EM>left recursive</EM> since <CODE>input</CODE> appears always as the
+leftmost symbol in the sequence.  See section <A HREF="bison.html#SEC42">Recursive Rules</A>.
+<P>
+The first alternative is empty because there are no symbols between the
+colon and the first <SAMP>`|'</SAMP>; this means that <CODE>input</CODE> can match an
+empty string of input (no tokens).  We write the rules this way because it
+is legitimate to type <KBD>Ctrl-d</KBD> right after you start the calculator.
+<P>
+It's conventional to put an empty alternative first and write the comment
+<SAMP>`/* empty */'</SAMP> in it.
+<P>
+The second alternate rule (<CODE>input line</CODE>) handles all nontrivial input.
+It means, "After reading any number of lines, read one more line if
+possible."  The left recursion makes this rule into a loop.  Since the
+first alternative matches empty input, the loop can be executed zero or
+more times.
+<P>
+The parser function <CODE>yyparse</CODE> continues to process input until a
+grammatical error is seen or the lexical analyzer says there are no more
+input tokens; we will arrange for the latter to happen at end of file.
+<H4><A NAME="SEC20" HREF="bison.html#TOC20">Explanation of <CODE>line</CODE></A></H4>
+<P>
+Now consider the definition of <CODE>line</CODE>:
+<PRE>
+<BLOCKQUOTE>
+line:     '\n'
+        | exp '\n'  { printf ("\t%.10g\n", $1); }
+;
+</PRE>
+</BLOCKQUOTE>
+<P>
+The first alternative is a token which is a newline character; this means
+that rpcalc accepts a blank line (and ignores it, since there is no
+action).  The second alternative is an expression followed by a newline.
+This is the alternative that makes rpcalc useful.  The semantic value of
+the <CODE>exp</CODE> grouping is the value of <CODE>$1</CODE> because the <CODE>exp</CODE> in
+question is the first symbol in the alternative.  The action prints this
+value, which is the result of the computation the user asked for.
+This action is unusual because it does not assign a value to <CODE>$$</CODE>.  As
+a consequence, the semantic value associated with the <CODE>line</CODE> is
+uninitialized (its value will be unpredictable).  This would be a bug if
+that value were ever used, but we don't use it: once rpcalc has printed the
+value of the user's input line, that value is no longer needed.
+<H4><A NAME="SEC21" HREF="bison.html#TOC21">Explanation of <CODE>expr</CODE></A></H4>
+<P>
+The <CODE>exp</CODE> grouping has several rules, one for each kind of expression.
+The first rule handles the simplest expressions: those that are just numbers.
+The second handles an addition-expression, which looks like two expressions
+followed by a plus-sign.  The third handles subtraction, and so on.
+<BLOCKQUOTE>
+<PRE>
+exp:      NUM
+        | exp exp '+'     { $$ = $1 + $2;    }
+        | exp exp '-'     { $$ = $1 - $2;    }
+        ...
+        ;
+</PRE>
+</BLOCKQUOTE>
+<P>
+We have used <SAMP>`|'</SAMP> to join all the rules for <CODE>exp</CODE>, but we could
+equally well have written them separately:
+<BLOCKQUOTE>
+<PRE>
+exp:      NUM ;
+exp:      exp exp '+'     { $$ = $1 + $2;    } ;
+exp:      exp exp '-'     { $$ = $1 - $2;    } ;
+        ...
+</PRE>
+</BLOCKQUOTE>
+<P>
+Most of the rules have actions that compute the value of the expression in
+terms of the value of its parts.  For example, in the rule for addition,
+<CODE>$1</CODE> refers to the first component <CODE>exp</CODE> and <CODE>$2</CODE> refers to
+the second one.  The third component, <CODE>'+'</CODE>, has no meaningful
+associated semantic value, but if it had one you could refer to it as
+<CODE>$3</CODE>.  When <CODE>yyparse</CODE> recognizes a sum expression using this
+rule, the sum of the two subexpressions' values is produced as the value of
+the entire expression.  See section <A HREF="bison.html#SEC46">Actions</A>.
+You don't have to give an action for every rule.  When a rule has no
+action, Bison by default copies the value of <CODE>$1</CODE> into <CODE>$$</CODE>.
+This is what happens in the first rule (the one that uses <CODE>NUM</CODE>).
+The formatting shown here is the recommended convention, but Bison does
+not require it.  You can add or change whitespace as much as you wish.
+For example, this:
+<PRE>
+exp   : NUM | exp exp '+' {$$ = $1 + $2; } | ...
+</PRE>
+<P>
+means the same thing as this:
+<PRE>
+exp:      NUM
+        | exp exp '+'    { $$ = $1 + $2; }
+        | ...
+</PRE>
+<P>
+The latter, however, is much more readable.
+<H3><A NAME="SEC22" HREF="bison.html#TOC22">The <CODE>rpcalc</CODE> Lexical Analyzer</A></H3>
+<P>
+<A NAME="IDX34"></A>
+<A NAME="IDX35"></A>
+The lexical analyzer's job is low-level parsing: converting characters or
+sequences of characters into tokens.  The Bison parser gets its tokens by
+calling the lexical analyzer.  See section <A HREF="bison.html#SEC61">The Lexical Analyzer Function <CODE>yylex</CODE></A>.
+Only a simple lexical analyzer is needed for the RPN calculator.  This
+lexical analyzer skips blanks and tabs, then reads in numbers as
+<CODE>double</CODE> and returns them as <CODE>NUM</CODE> tokens.  Any other character
+that isn't part of a number is a separate token.  Note that the token-code
+for such a single-character token is the character itself.
+The return value of the lexical analyzer function is a numeric code which
+represents a token type.  The same text used in Bison rules to stand for
+this token type is also a C expression for the numeric code for the type.
+This works in two ways.  If the token type is a character literal, then its
+numeric code is the ASCII code for that character; you can use the same
+character literal in the lexical analyzer to express the number.  If the
+token type is an identifier, that identifier is defined by Bison as a C
+macro whose definition is the appropriate number.  In this example,
+therefore, <CODE>NUM</CODE> becomes a macro for <CODE>yylex</CODE> to use.
+The semantic value of the token (if it has one) is stored into the global
+variable <CODE>yylval</CODE>, which is where the Bison parser will look for it.
+(The C data type of <CODE>yylval</CODE> is <CODE>YYSTYPE</CODE>, which was defined
+at the beginning of the grammar; see section <A HREF="bison.html#SEC17">Declarations for <CODE>rpcalc</CODE></A>.)
+A token type code of zero is returned if the end-of-file is encountered.
+(Bison recognizes any nonpositive value as indicating the end of the
+input.)
+Here is the code for the lexical analyzer:
+<PRE>
+/* Lexical analyzer returns a double floating point 
+   number on the stack and the token NUM, or the ASCII
+   character read if not a number.  Skips all blanks
+   and tabs, returns 0 for EOF. */
+#include &#60;ctype.h&#62;
+yylex ()
+{
+  int c;
+  /* skip white space  */
+  while ((c = getchar ()) == ' ' || c == '\t')  
+    ;
+  /* process numbers   */
+  if (c == '.' || isdigit (c))                
+    {
+      ungetc (c, stdin);
+      scanf ("%lf", &#38;yylval);
+      return NUM;
+    }
+  /* return end-of-file  */
+  if (c == EOF)                            
+    return 0;
+  /* return single chars */
+  return c;                                
+}
+</PRE>
+<P>
+<H3><A NAME="SEC23" HREF="bison.html#TOC23">The Controlling Function</A></H3>
+<P>
+<A NAME="IDX36"></A>
+<A NAME="IDX37"></A>
+In keeping with the spirit of this example, the controlling function is
+kept to the bare minimum.  The only requirement is that it call
+<CODE>yyparse</CODE> to start the process of parsing.
+<PRE>
+main ()
+{
+  yyparse ();
+}
+</PRE>
+<P>
+<H3><A NAME="SEC24" HREF="bison.html#TOC24">The Error Reporting Routine</A></H3>
+<P>
+<A NAME="IDX38"></A>
+When <CODE>yyparse</CODE> detects a syntax error, it calls the error reporting
+function <CODE>yyerror</CODE> to print an error message (usually but not always
+<CODE>"parse error"</CODE>).  It is up to the programmer to supply <CODE>yyerror</CODE>
+(see section <A HREF="bison.html#SEC59">Parser C-Language Interface</A>), so here is the definition we will use:
+<PRE>
+#include &#60;stdio.h&#62;
+yyerror (s)  /* Called by yyparse on error */
+     char *s;
+{
+  printf ("%s\n", s);
+}
+</PRE>
+<P>
+After <CODE>yyerror</CODE> returns, the Bison parser may recover from the error
+and continue parsing if the grammar contains a suitable error rule
+(see section <A HREF="bison.html#SEC81">Error Recovery</A>).  Otherwise, <CODE>yyparse</CODE> returns nonzero.  We
+have not written any error rules in this example, so any invalid input will
+cause the calculator program to exit.  This is not clean behavior for a
+real calculator, but it is adequate in the first example.
+<H3><A NAME="SEC25" HREF="bison.html#TOC25">Running Bison to Make the Parser</A></H3>
+<P>
+<A NAME="IDX39"></A>
+Before running Bison to produce a parser, we need to decide how to arrange
+all the source code in one or more source files.  For such a simple example,
+the easiest thing is to put everything in one file.  The definitions of
+<CODE>yylex</CODE>, <CODE>yyerror</CODE> and <CODE>main</CODE> go at the end, in the
+"additional C code" section of the file (see section <A HREF="bison.html#SEC14">The Overall Layout of a Bison Grammar</A>).
+For a large project, you would probably have several source files, and use
+<CODE>make</CODE> to arrange to recompile them.
+With all the source in a single file, you use the following command to
+convert it into a parser file:
+<PRE>
+bison <VAR>file_name</VAR>.y
+</PRE>
+<P>
+In this example the file was called <TT>`rpcalc.y'</TT> (for "Reverse Polish
+CALCulator").  Bison produces a file named <TT>`<VAR>file_name</VAR>.tab.c'</TT>,
+removing the <SAMP>`.y'</SAMP> from the original file name. The file output by
+Bison contains the source code for <CODE>yyparse</CODE>.  The additional
+functions in the input file (<CODE>yylex</CODE>, <CODE>yyerror</CODE> and <CODE>main</CODE>)
+are copied verbatim to the output.
+<H3><A NAME="SEC26" HREF="bison.html#TOC26">Compiling the Parser File</A></H3>
+<P>
+<A NAME="IDX40"></A>
+Here is how to compile and run the parser file:
+<PRE>
+# List files in current directory.
+% ls
+rpcalc.tab.c  rpcalc.y
+# Compile the Bison parser.
+# <SAMP>`-lm'</SAMP> tells compiler to search math library for <CODE>pow</CODE>.
+% cc rpcalc.tab.c -lm -o rpcalc
+# List files again.
+% ls
+rpcalc  rpcalc.tab.c  rpcalc.y
+</PRE>
+<P>
+The file <TT>`rpcalc'</TT> now contains the executable code.  Here is an
+example session using <CODE>rpcalc</CODE>.
+<PRE>
+% rpcalc
+4 9 +
+13
+3 7 + 3 4 5 *+-
+-13
+3 7 + 3 4 5 * + - n              Note the unary minus, <SAMP>`n'</SAMP>
+13
+5 6 / 4 n +
+-3.166666667
+3 4 ^                            Exponentiation
+81
+^D                               End-of-file indicator
+%
+</PRE>
+<P>
+<H2><A NAME="SEC27" HREF="bison.html#TOC27">Infix Notation Calculator: <CODE>calc</CODE></A></H2>
+<P>
+<A NAME="IDX41"></A>
+<A NAME="IDX42"></A>
+<A NAME="IDX43"></A>
+We now modify rpcalc to handle infix operators instead of postfix.  Infix
+notation involves the concept of operator precedence and the need for
+parentheses nested to arbitrary depth.  Here is the Bison code for
+<TT>`calc.y'</TT>, an infix desk-top calculator.
+<PRE>
+/* Infix notation calculator--calc */
+%{
+#define YYSTYPE double
+#include &#60;math.h&#62;
+%}
+/* BISON Declarations */
+%token NUM
+%left '-' '+'
+%left '*' '/'
+%left NEG     /* negation--unary minus */
+%right '^'    /* exponentiation        */
+/* Grammar follows */
+%%
+input:    /* empty string */
+        | input line
+;
+line:     '\n'
+        | exp '\n'  { printf ("\t%.10g\n", $1); }
+;
+exp:      NUM                { $$ = $1;         }
+        | exp '+' exp        { $$ = $1 + $3;    }
+        | exp '-' exp        { $$ = $1 - $3;    }
+        | exp '*' exp        { $$ = $1 * $3;    }
+        | exp '/' exp        { $$ = $1 / $3;    }
+        | '-' exp  %prec NEG { $$ = -$2;        }
+        | exp '^' exp        { $$ = pow ($1, $3); }
+        | '(' exp ')'        { $$ = $2;         }
+;
+%%
+</PRE>
+<P>
+The functions <CODE>yylex</CODE>, <CODE>yyerror</CODE> and <CODE>main</CODE> can be the same
+as before.
+There are two important new features shown in this code.
+In the second section (Bison declarations), <CODE>%left</CODE> declares token
+types and says they are left-associative operators.  The declarations
+<CODE>%left</CODE> and <CODE>%right</CODE> (right associativity) take the place of
+<CODE>%token</CODE> which is used to declare a token type name without
+associativity.  (These tokens are single-character literals, which
+ordinarily don't need to be declared.  We declare them here to specify
+the associativity.)
+Operator precedence is determined by the line ordering of the
+declarations; the higher the line number of the declaration (lower on
+the page or screen), the higher the precedence.  Hence, exponentiation
+has the highest precedence, unary minus (<CODE>NEG</CODE>) is next, followed
+by <SAMP>`*'</SAMP> and <SAMP>`/'</SAMP>, and so on.  See section <A HREF="bison.html#SEC71">Operator Precedence</A>.
+The other important new feature is the <CODE>%prec</CODE> in the grammar section
+for the unary minus operator.  The <CODE>%prec</CODE> simply instructs Bison that
+the rule <SAMP>`| '-' exp'</SAMP> has the same precedence as <CODE>NEG</CODE>---in this
+case the next-to-highest.  See section <A HREF="bison.html#SEC76">Context-Dependent Precedence</A>.
+Here is a sample run of <TT>`calc.y'</TT>:
+<PRE>
+% calc
+4 + 4.5 - (34/(8*3+-3))
+6.880952381
+-56 + 2
+-54
+3 ^ 2
+9
+</PRE>
+<P>
+<H2><A NAME="SEC28" HREF="bison.html#TOC28">Simple Error Recovery</A></H2>
+<P>
+<A NAME="IDX44"></A>
+Up to this point, this manual has not addressed the issue of <EM>error
+recovery</EM>---how to continue parsing after the parser detects a syntax
+error.  All we have handled is error reporting with <CODE>yyerror</CODE>.  Recall
+that by default <CODE>yyparse</CODE> returns after calling <CODE>yyerror</CODE>.  This
+means that an erroneous input line causes the calculator program to exit.
+Now we show how to rectify this deficiency.
+The Bison language itself includes the reserved word <CODE>error</CODE>, which
+may be included in the grammar rules.  In the example below it has
+been added to one of the alternatives for <CODE>line</CODE>:
+<PRE>
+line:     '\n'
+        | exp '\n'   { printf ("\t%.10g\n", $1); }
+        | error '\n' { yyerrok;                  }
+;
+</PRE>
+<P>
+This addition to the grammar allows for simple error recovery in the event
+of a parse error.  If an expression that cannot be evaluated is read, the
+error will be recognized by the third rule for <CODE>line</CODE>, and parsing
+will continue.  (The <CODE>yyerror</CODE> function is still called upon to print
+its message as well.)  The action executes the statement <CODE>yyerrok</CODE>, a
+macro defined automatically by Bison; its meaning is that error recovery is
+complete (see section <A HREF="bison.html#SEC81">Error Recovery</A>).  Note the difference between
+<CODE>yyerrok</CODE> and <CODE>yyerror</CODE>; neither one is a misprint.
+This form of error recovery deals with syntax errors.  There are other
+kinds of errors; for example, division by zero, which raises an exception
+signal that is normally fatal.  A real calculator program must handle this
+signal and use <CODE>longjmp</CODE> to return to <CODE>main</CODE> and resume parsing
+input lines; it would also have to discard the rest of the current line of
+input.  We won't discuss this issue further because it is not specific to
+Bison programs.
+<H2><A NAME="SEC29" HREF="bison.html#TOC29">Multi-Function Calculator: <CODE>mfcalc</CODE></A></H2>
+<P>
+<A NAME="IDX45"></A>
+<A NAME="IDX46"></A>
+<A NAME="IDX47"></A>
+Now that the basics of Bison have been discussed, it is time to move on to
+a more advanced problem.  The above calculators provided only five
+functions, <SAMP>`+'</SAMP>, <SAMP>`-'</SAMP>, <SAMP>`*'</SAMP>, <SAMP>`/'</SAMP> and <SAMP>`^'</SAMP>.  It would
+be nice to have a calculator that provides other mathematical functions such
+as <CODE>sin</CODE>, <CODE>cos</CODE>, etc.
+It is easy to add new operators to the infix calculator as long as they are
+only single-character literals.  The lexical analyzer <CODE>yylex</CODE> passes
+back all non-number characters as tokens, so new grammar rules suffice for
+adding a new operator.  But we want something more flexible: built-in
+functions whose syntax has this form:
+<PRE>
+<VAR>function_name</VAR> (<VAR>argument</VAR>)
+</PRE>
+<P>
+At the same time, we will add memory to the calculator, by allowing you
+to create named variables, store values in them, and use them later.
+Here is a sample session with the multi-function calculator:
+<PRE>
+% mfcalc
+pi = 3.141592653589
+3.1415926536
+sin(pi)
+0.0000000000
+alpha = beta1 = 2.3
+2.3000000000
+alpha
+2.3000000000
+ln(alpha)
+0.8329091229
+exp(ln(beta1))
+2.3000000000
+%
+</PRE>
+<P>
+Note that multiple assignment and nested function calls are permitted.
+<H3><A NAME="SEC30" HREF="bison.html#TOC30">Declarations for <CODE>mfcalc</CODE></A></H3>
+<P>
+Here are the C and Bison declarations for the multi-function calculator.
+<PRE>
+%{
+#include &#60;math.h&#62;  /* For math functions, cos(), sin(), etc. */
+#include "calc.h"  /* Contains definition of `symrec'        */
+%}
+%union {
+double     val;  /* For returning numbers.                   */
+symrec  *tptr;   /* For returning symbol-table pointers      */
+}
+%token &#60;val&#62;  NUM        /* Simple double precision number   */
+%token &#60;tptr&#62; VAR FNCT   /* Variable and Function            */
+%type  &#60;val&#62;  exp
+%right '='
+%left '-' '+'
+%left '*' '/'
+%left NEG     /* Negation--unary minus */
+%right '^'    /* Exponentiation        */
+/* Grammar follows */
+%%
+</PRE>
+<P>
+The above grammar introduces only two new features of the Bison language.
+These features allow semantic values to have various data types
+(see section <A HREF="bison.html#SEC45">More Than One Value Type</A>).
+The <CODE>%union</CODE> declaration specifies the entire list of possible types;
+this is instead of defining <CODE>YYSTYPE</CODE>.  The allowable types are now
+double-floats (for <CODE>exp</CODE> and <CODE>NUM</CODE>) and pointers to entries in
+the symbol table.  See section <A HREF="bison.html#SEC52">The Collection of Value Types</A>.
+Since values can now have various types, it is necessary to associate a
+type with each grammar symbol whose semantic value is used.  These symbols
+are <CODE>NUM</CODE>, <CODE>VAR</CODE>, <CODE>FNCT</CODE>, and <CODE>exp</CODE>.  Their
+declarations are augmented with information about their data type (placed
+between angle brackets).
+The Bison construct <CODE>%type</CODE> is used for declaring nonterminal symbols,
+just as <CODE>%token</CODE> is used for declaring token types.  We have not used
+<CODE>%type</CODE> before because nonterminal symbols are normally declared
+implicitly by the rules that define them.  But <CODE>exp</CODE> must be declared
+explicitly so we can specify its value type.  See section <A HREF="bison.html#SEC53">Nonterminal Symbols</A>.
+<H3><A NAME="SEC31" HREF="bison.html#TOC31">Grammar Rules for <CODE>mfcalc</CODE></A></H3>
+<P>
+Here are the grammar rules for the multi-function calculator.
+Most of them are copied directly from <CODE>calc</CODE>; three rules,
+those which mention <CODE>VAR</CODE> or <CODE>FNCT</CODE>, are new.
+<PRE>
+input:   /* empty */
+        | input line
+;
+line:
+          '\n'
+        | exp '\n'   { printf ("\t%.10g\n", $1); }
+        | error '\n' { yyerrok;                  }
+;
+exp:      NUM                { $$ = $1;                         }
+        | VAR                { $$ = $1-&#62;value.var;              }
+        | VAR '=' exp        { $$ = $3; $1-&#62;value.var = $3;     }
+        | FNCT '(' exp ')'   { $$ = (*($1-&#62;value.fnctptr))($3); }
+        | exp '+' exp        { $$ = $1 + $3;                    }
+        | exp '-' exp        { $$ = $1 - $3;                    }
+        | exp '*' exp        { $$ = $1 * $3;                    }
+        | exp '/' exp        { $$ = $1 / $3;                    }
+        | '-' exp  %prec NEG { $$ = -$2;                        }
+        | exp '^' exp        { $$ = pow ($1, $3);               }
+        | '(' exp ')'        { $$ = $2;                         }
+;
+/* End of grammar */
+%%
+</PRE>
+<P>
+<H3><A NAME="SEC32" HREF="bison.html#TOC32">The <CODE>mfcalc</CODE> Symbol Table</A></H3>
+<P>
+<A NAME="IDX48"></A>
+The multi-function calculator requires a symbol table to keep track of the
+names and meanings of variables and functions.  This doesn't affect the
+grammar rules (except for the actions) or the Bison declarations, but it
+requires some additional C functions for support.
+The symbol table itself consists of a linked list of records.  Its
+definition, which is kept in the header <TT>`calc.h'</TT>, is as follows.  It
+provides for either functions or variables to be placed in the table.
+<PRE>
+/* Data type for links in the chain of symbols.      */
+struct symrec
+{
+  char *name;  /* name of symbol                     */
+  int type;    /* type of symbol: either VAR or FNCT */
+  union {
+    double var;           /* value of a VAR          */
+    double (*fnctptr)();  /* value of a FNCT         */
+  } value;
+  struct symrec *next;    /* link field              */
+};
+typedef struct symrec symrec;
+/* The symbol table: a chain of `struct symrec'.     */
+extern symrec *sym_table;
+symrec *putsym ();
+symrec *getsym ();
+</PRE>
+<P>
+The new version of <CODE>main</CODE> includes a call to <CODE>init_table</CODE>, a
+function that initializes the symbol table.  Here it is, and
+<CODE>init_table</CODE> as well:
+<PRE>
+#include &#60;stdio.h&#62;
+main ()
+{
+  init_table ();
+  yyparse ();
+}
+yyerror (s)  /* Called by yyparse on error */
+     char *s;
+{
+  printf ("%s\n", s);
+}
+struct init
+{
+  char *fname;
+  double (*fnct)();
+};
+struct init arith_fncts[]
+  = {
+      "sin", sin,
+      "cos", cos,
+      "atan", atan,
+      "ln", log,
+      "exp", exp,
+      "sqrt", sqrt,
+      0, 0
+    };
+/* The symbol table: a chain of `struct symrec'.  */
+symrec *sym_table = (symrec *)0;
+init_table ()  /* puts arithmetic functions in table. */
+{
+  int i;
+  symrec *ptr;
+  for (i = 0; arith_fncts[i].fname != 0; i++)
+    {
+      ptr = putsym (arith_fncts[i].fname, FNCT);
+      ptr-&#62;value.fnctptr = arith_fncts[i].fnct;
+    }
+}
+</PRE>
+<P>
+By simply editing the initialization list and adding the necessary include
+files, you can add additional functions to the calculator.
+Two important functions allow look-up and installation of symbols in the
+symbol table.  The function <CODE>putsym</CODE> is passed a name and the type
+(<CODE>VAR</CODE> or <CODE>FNCT</CODE>) of the object to be installed.  The object is
+linked to the front of the list, and a pointer to the object is returned.
+The function <CODE>getsym</CODE> is passed the name of the symbol to look up.  If
+found, a pointer to that symbol is returned; otherwise zero is returned.
+<PRE>
+symrec *
+putsym (sym_name,sym_type)
+     char *sym_name;
+     int sym_type;
+{
+  symrec *ptr;
+  ptr = (symrec *) malloc (sizeof (symrec));
+  ptr-&#62;name = (char *) malloc (strlen (sym_name) + 1);
+  strcpy (ptr-&#62;name,sym_name);
+  ptr-&#62;type = sym_type;
+  ptr-&#62;value.var = 0; /* set value to 0 even if fctn.  */
+  ptr-&#62;next = (struct symrec *)sym_table;
+  sym_table = ptr;
+  return ptr;
+}
+symrec *
+getsym (sym_name)
+     char *sym_name;
+{
+  symrec *ptr;
+  for (ptr = sym_table; ptr != (symrec *) 0;
+       ptr = (symrec *)ptr-&#62;next)
+    if (strcmp (ptr-&#62;name,sym_name) == 0)
+      return ptr;
+  return 0;
+}
+</PRE>
+<P>
+The function <CODE>yylex</CODE> must now recognize variables, numeric values, and
+the single-character arithmetic operators.  Strings of alphanumeric
+characters with a leading nondigit are recognized as either variables or
+functions depending on what the symbol table says about them.
+The string is passed to <CODE>getsym</CODE> for look up in the symbol table.  If
+the name appears in the table, a pointer to its location and its type
+(<CODE>VAR</CODE> or <CODE>FNCT</CODE>) is returned to <CODE>yyparse</CODE>.  If it is not
+already in the table, then it is installed as a <CODE>VAR</CODE> using
+<CODE>putsym</CODE>.  Again, a pointer and its type (which must be <CODE>VAR</CODE>) is
+returned to <CODE>yyparse</CODE>.
+No change is needed in the handling of numeric values and arithmetic
+operators in <CODE>yylex</CODE>.
+<PRE>
+#include &#60;ctype.h&#62;
+yylex ()
+{
+  int c;
+  /* Ignore whitespace, get first nonwhite character.  */
+  while ((c = getchar ()) == ' ' || c == '\t');
+  if (c == EOF)
+    return 0;
+  /* Char starts a number =&#62; parse the number.         */
+  if (c == '.' || isdigit (c))
+    {
+      ungetc (c, stdin);
+      scanf ("%lf", &#38;yylval.val);
+      return NUM;
+    }
+  /* Char starts an identifier =&#62; read the name.       */
+  if (isalpha (c))
+    {
+      symrec *s;
+      static char *symbuf = 0;
+      static int length = 0;
+      int i;
+      /* Initially make the buffer long enough
+         for a 40-character symbol name.  */
+      if (length == 0)
+        length = 40, symbuf = (char *)malloc (length + 1);
+      i = 0;
+      do
+        {
+          /* If buffer is full, make it bigger.        */
+          if (i == length)
+            {
+              length *= 2;
+              symbuf = (char *)realloc (symbuf, length + 1);
+            }
+          /* Add this character to the buffer.         */
+          symbuf[i++] = c;
+          /* Get another character.                    */
+          c = getchar ();
+        }
+      while (c != EOF &#38;&#38; isalnum (c));
+      ungetc (c, stdin);
+      symbuf[i] = '\0';
+      s = getsym (symbuf);
+      if (s == 0)
+        s = putsym (symbuf, VAR);
+      yylval.tptr = s;
+      return s-&#62;type;
+    }
+  /* Any other character is a token by itself.        */
+  return c;
+}
+</PRE>
+<P>
+This program is both powerful and flexible. You may easily add new
+functions, and it is a simple job to modify this code to install predefined
+variables such as <CODE>pi</CODE> or <CODE>e</CODE> as well.
+<H2><A NAME="SEC33" HREF="bison.html#TOC33">Exercises</A></H2>
+<P>
+<A NAME="IDX49"></A>
+<OL>
+<LI>
+Add some new functions from <TT>`math.h'</TT> to the initialization list.
+<LI>
+Add another array that contains constants and their values.  Then
+modify <CODE>init_table</CODE> to add these constants to the symbol table.
+It will be easiest to give the constants type <CODE>VAR</CODE>.
+<LI>
+Make the program report an error if the user refers to an
+uninitialized variable in any way except to store a value in it.
+</OL>
+<P>
+<H1><A NAME="SEC34" HREF="bison.html#TOC34">Bison Grammar Files</A></H1>
+<P>
+Bison takes as input a context-free grammar specification and produces a
+C-language function that recognizes correct instances of the grammar.
+The Bison grammar input file conventionally has a name ending in <SAMP>`.y'</SAMP>.
+<H2><A NAME="SEC35" HREF="bison.html#TOC35">Outline of a Bison Grammar</A></H2>
+<P>
+A Bison grammar file has four main sections, shown here with the
+appropriate delimiters:
+<PRE>
+%{
+<VAR>C declarations</VAR>
+%}
+<VAR>Bison declarations</VAR>
+%%
+<VAR>Grammar rules</VAR>
+%%
+<VAR>Additional C code</VAR>
+</PRE>
+<P>
+Comments enclosed in <SAMP>`/* ... */'</SAMP> may appear in any of the sections.
+<H3><A NAME="SEC36" HREF="bison.html#TOC36">The C Declarations Section</A></H3>
+<P>
+<A NAME="IDX50"></A>
+<A NAME="IDX51"></A>
+The <VAR>C declarations</VAR> section contains macro definitions and
+declarations of functions and variables that are used in the actions in the
+grammar rules.  These are copied to the beginning of the parser file so
+that they precede the definition of <CODE>yyparse</CODE>.  You can use
+<SAMP>`#include'</SAMP> to get the declarations from a header file.  If you don't
+need any C declarations, you may omit the <SAMP>`%{'</SAMP> and <SAMP>`%}'</SAMP>
+delimiters that bracket this section.
+<H3><A NAME="SEC37" HREF="bison.html#TOC37">The Bison Declarations Section</A></H3>
+<P>
+<A NAME="IDX52"></A>
+<A NAME="IDX53"></A>
+The <VAR>Bison declarations</VAR> section contains declarations that define
+terminal and nonterminal symbols, specify precedence, and so on.
+In some simple grammars you may not need any declarations.
+See section <A HREF="bison.html#SEC49">Bison Declarations</A>.
+<H3><A NAME="SEC38" HREF="bison.html#TOC38">The Grammar Rules Section</A></H3>
+<P>
+<A NAME="IDX54"></A>
+<A NAME="IDX55"></A>
+The <EM>grammar rules</EM> section contains one or more Bison grammar
+rules, and nothing else.  See section <A HREF="bison.html#SEC41">Syntax of Grammar Rules</A>.
+There must always be at least one grammar rule, and the first
+<SAMP>`%%'</SAMP> (which precedes the grammar rules) may never be omitted even
+if it is the first thing in the file.
+<H3><A NAME="SEC39" HREF="bison.html#TOC39">The Additional C Code Section</A></H3>
+<P>
+<A NAME="IDX56"></A>
+<A NAME="IDX57"></A>
+The <VAR>additional C code</VAR> section is copied verbatim to the end of
+the parser file, just as the <VAR>C declarations</VAR> section is copied to
+the beginning.  This is the most convenient place to put anything
+that you want to have in the parser file but which need not come before
+the definition of <CODE>yyparse</CODE>.  For example, the definitions of
+<CODE>yylex</CODE> and <CODE>yyerror</CODE> often go here.  See section <A HREF="bison.html#SEC59">Parser C-Language Interface</A>.
+If the last section is empty, you may omit the <SAMP>`%%'</SAMP> that separates it
+from the grammar rules.
+The Bison parser itself contains many static variables whose names start
+with <SAMP>`yy'</SAMP> and many macros whose names start with <SAMP>`YY'</SAMP>.  It is a
+good idea to avoid using any such names (except those documented in this
+manual) in the additional C code section of the grammar file.
+<H2><A NAME="SEC40" HREF="bison.html#TOC40">Symbols, Terminal and Nonterminal</A></H2>
+<P>
+<A NAME="IDX58"></A>
+<A NAME="IDX59"></A>
+<A NAME="IDX60"></A>
+<A NAME="IDX61"></A>
+<EM>Symbols</EM> in Bison grammars represent the grammatical classifications
+of the language.
+A <EM>terminal symbol</EM> (also known as a <EM>token type</EM>) represents a
+class of syntactically equivalent tokens.  You use the symbol in grammar
+rules to mean that a token in that class is allowed.  The symbol is
+represented in the Bison parser by a numeric code, and the <CODE>yylex</CODE>
+function returns a token type code to indicate what kind of token has been
+read.  You don't need to know what the code value is; you can use the
+symbol to stand for it.
+A <EM>nonterminal symbol</EM> stands for a class of syntactically equivalent
+groupings.  The symbol name is used in writing grammar rules.  By convention,
+it should be all lower case.
+Symbol names can contain letters, digits (not at the beginning),
+underscores and periods.  Periods make sense only in nonterminals.
+There are two ways of writing terminal symbols in the grammar:
+<UL>
+<LI>
+A <EM>named token type</EM> is written with an identifier, like an
+identifier in C.  By convention, it should be all upper case.  Each
+such name must be defined with a Bison declaration such as
+<CODE>%token</CODE>.  See section <A HREF="bison.html#SEC50">Token Type Names</A>.
+<LI>
+<A NAME="IDX62"></A>
+<A NAME="IDX63"></A>
+<A NAME="IDX64"></A>
+A <EM>character token type</EM> (or <EM>literal token</EM>) is written in
+the grammar using the same syntax used in C for character constants;
+for example, <CODE>'+'</CODE> is a character token type.  A character token
+type doesn't need to be declared unless you need to specify its
+semantic value data type (see section <A HREF="bison.html#SEC44">Data Types of Semantic Values</A>), associativity, or
+precedence (see section <A HREF="bison.html#SEC71">Operator Precedence</A>).
+By convention, a character token type is used only to represent a
+token that consists of that particular character.  Thus, the token
+type <CODE>'+'</CODE> is used to represent the character <SAMP>`+'</SAMP> as a
+token.  Nothing enforces this convention, but if you depart from it,
+your program will confuse other readers.
+All the usual escape sequences used in character literals in C can be
+used in Bison as well, but you must not use the null character as a
+character literal because its ASCII code, zero, is the code
+<CODE>yylex</CODE> returns for end-of-input (see section <A HREF="bison.html#SEC62">Calling Convention for <CODE>yylex</CODE></A>).
+</UL>
+<P>
+How you choose to write a terminal symbol has no effect on its
+grammatical meaning.  That depends only on where it appears in rules and
+on when the parser function returns that symbol.
+The value returned by <CODE>yylex</CODE> is always one of the terminal symbols
+(or 0 for end-of-input).  Whichever way you write the token type in the
+grammar rules, you write it the same way in the definition of <CODE>yylex</CODE>.
+The numeric code for a character token type is simply the ASCII code for
+the character, so <CODE>yylex</CODE> can use the identical character constant to
+generate the requisite code.  Each named token type becomes a C macro in
+the parser file, so <CODE>yylex</CODE> can use the name to stand for the code.
+(This is why periods don't make sense in terminal symbols.)  
+See section <A HREF="bison.html#SEC62">Calling Convention for <CODE>yylex</CODE></A>.
+If <CODE>yylex</CODE> is defined in a separate file, you need to arrange for the
+token-type macro definitions to be available there.  Use the <SAMP>`-d'</SAMP>
+option when you run Bison, so that it will write these macro definitions
+into a separate header file <TT>`<VAR>name</VAR>.tab.h'</TT> which you can include
+in the other source files that need it.  See section <A HREF="bison.html#SEC87">Invoking Bison</A>.
+The symbol <CODE>error</CODE> is a terminal symbol reserved for error recovery
+(see section <A HREF="bison.html#SEC81">Error Recovery</A>); you shouldn't use it for any other purpose.
+In particular, <CODE>yylex</CODE> should never return this value.
+<H2><A NAME="SEC41" HREF="bison.html#TOC41">Syntax of Grammar Rules</A></H2>
+<P>
+<A NAME="IDX65"></A>
+<A NAME="IDX66"></A>
+<A NAME="IDX67"></A>
+A Bison grammar rule has the following general form:
+<PRE>
+<VAR>result</VAR>: <VAR>components</VAR>...
+        ;
+</PRE>
+<P>
+where <VAR>result</VAR> is the nonterminal symbol that this rule describes
+and <VAR>components</VAR> are various terminal and nonterminal symbols that
+are put together by this rule (see section <A HREF="bison.html#SEC40">Symbols, Terminal and Nonterminal</A>).  
+For example,
+<PRE>
+exp:      exp '+' exp
+        ;
+</PRE>
+<P>
+says that two groupings of type <CODE>exp</CODE>, with a <SAMP>`+'</SAMP> token in between,
+can be combined into a larger grouping of type <CODE>exp</CODE>.
+Whitespace in rules is significant only to separate symbols.  You can add
+extra whitespace as you wish.
+Scattered among the components can be <VAR>actions</VAR> that determine
+the semantics of the rule.  An action looks like this:
+<PRE>
+{<VAR>C statements</VAR>}
+</PRE>
+<P>
+Usually there is only one action and it follows the components.
+See section <A HREF="bison.html#SEC46">Actions</A>.
+<A NAME="IDX68"></A>
+Multiple rules for the same <VAR>result</VAR> can be written separately or can
+be joined with the vertical-bar character <SAMP>`|'</SAMP> as follows:
+<PRE>
+<VAR>result</VAR>:    <VAR>rule1-components</VAR>...
+        | <VAR>rule2-components</VAR>...
+        ...
+        ;
+</PRE>
+<P>
+They are still considered distinct rules even when joined in this way.
+If <VAR>components</VAR> in a rule is empty, it means that <VAR>result</VAR> can
+match the empty string.  For example, here is how to define a
+comma-separated sequence of zero or more <CODE>exp</CODE> groupings:
+<PRE>
+expseq:   /* empty */
+        | expseq1
+        ;
+expseq1:  exp
+        | expseq1 ',' exp
+        ;
+</PRE>
+<P>
+It is customary to write a comment <SAMP>`/* empty */'</SAMP> in each rule
+with no components.
+<H2><A NAME="SEC42" HREF="bison.html#TOC42">Recursive Rules</A></H2>
+<P>
+<A NAME="IDX69"></A>
+A rule is called <EM>recursive</EM> when its <VAR>result</VAR> nonterminal appears
+also on its right hand side.  Nearly all Bison grammars need to use
+recursion, because that is the only way to define a sequence of any number
+of somethings.  Consider this recursive definition of a comma-separated
+sequence of one or more expressions:
+<PRE>
+expseq1:  exp
+        | expseq1 ',' exp
+        ;
+</PRE>
+<P>
+<A NAME="IDX70"></A>
+<A NAME="IDX71"></A>
+Since the recursive use of <CODE>expseq1</CODE> is the leftmost symbol in the
+right hand side, we call this <EM>left recursion</EM>.  By contrast, here
+the same construct is defined using <EM>right recursion</EM>:
+<PRE>
+expseq1:  exp
+        | exp ',' expseq1
+        ;
+</PRE>
+<P>
+Any kind of sequence can be defined using either left recursion or
+right recursion, but you should always use left recursion, because it
+can parse a sequence of any number of elements with bounded stack
+space.  Right recursion uses up space on the Bison stack in proportion
+to the number of elements in the sequence, because all the elements
+must be shifted onto the stack before the rule can be applied even
+once.  See section <A HREF="bison.html#SEC68">The Bison Parser Algorithm</A>, for
+further explanation of this.
+<A NAME="IDX72"></A>
+<EM>Indirect</EM> or <EM>mutual</EM> recursion occurs when the result of the
+rule does not appear directly on its right hand side, but does appear
+in rules for other nonterminals which do appear on its right hand
+side.  
+For example:
+<PRE>
+expr:     primary
+        | primary '+' primary
+        ;
+primary:  constant
+        | '(' expr ')'
+        ;
+</PRE>
+<P>
+defines two mutually-recursive nonterminals, since each refers to the
+other.
+<H2><A NAME="SEC43" HREF="bison.html#TOC43">Defining Language Semantics</A></H2>
+<P>
+<A NAME="IDX73"></A>
+<A NAME="IDX74"></A>
+The grammar rules for a language determine only the syntax.  The semantics
+are determined by the semantic values associated with various tokens and
+groupings, and by the actions taken when various groupings are recognized.
+For example, the calculator calculates properly because the value
+associated with each expression is the proper number; it adds properly
+because the action for the grouping <SAMP>`<VAR>x</VAR> + <VAR>y</VAR>'</SAMP> is to add
+the numbers associated with <VAR>x</VAR> and <VAR>y</VAR>.
+<H3><A NAME="SEC44" HREF="bison.html#TOC44">Data Types of Semantic Values</A></H3>
+<P>
+<A NAME="IDX75"></A>
+<A NAME="IDX76"></A>
+<A NAME="IDX77"></A>
+<A NAME="IDX78"></A>
+In a simple program it may be sufficient to use the same data type for
+the semantic values of all language constructs.  This was true in the
+RPN and infix calculator examples (see section <A HREF="bison.html#SEC16">Reverse Polish Notation Calculator</A>).
+Bison's default is to use type <CODE>int</CODE> for all semantic values.  To
+specify some other type, define <CODE>YYSTYPE</CODE> as a macro, like this:
+<PRE>
+#define YYSTYPE double
+</PRE>
+<P>
+This macro definition must go in the C declarations section of the grammar
+file (see section <A HREF="bison.html#SEC35">Outline of a Bison Grammar</A>).
+<H3><A NAME="SEC45" HREF="bison.html#TOC45">More Than One Value Type</A></H3>
+<P>
+In most programs, you will need different data types for different kinds
+of tokens and groupings.  For example, a numeric constant may need type
+<CODE>int</CODE> or <CODE>long</CODE>, while a string constant needs type <CODE>char *</CODE>,
+and an identifier might need a pointer to an entry in the symbol table.
+To use more than one data type for semantic values in one parser, Bison
+requires you to do two things:
+<UL>
+<LI>
+Specify the entire collection of possible data types, with the
+<CODE>%union</CODE> Bison declaration (see section <A HREF="bison.html#SEC52">The Collection of Value Types</A>).
+<LI>
+Choose one of those types for each symbol (terminal or nonterminal)
+for which semantic values are used.  This is done for tokens with the
+<CODE>%token</CODE> Bison declaration (see section <A HREF="bison.html#SEC50">Token Type Names</A>) and for groupings
+with the <CODE>%type</CODE> Bison declaration (see section <A HREF="bison.html#SEC53">Nonterminal Symbols</A>).
+</UL>
+<P>
+<H3><A NAME="SEC46" HREF="bison.html#TOC46">Actions</A></H3>
+<P>
+<A NAME="IDX79"></A>
+<A NAME="IDX80"></A>
+<A NAME="IDX81"></A>
+An action accompanies a syntactic rule and contains C code to be executed
+each time an instance of that rule is recognized.  The task of most actions
+is to compute a semantic value for the grouping built by the rule from the
+semantic values associated with tokens or smaller groupings.
+An action consists of C statements surrounded by braces, much like a
+compound statement in C.  It can be placed at any position in the rule; it
+is executed at that position.  Most rules have just one action at the end
+of the rule, following all the components.  Actions in the middle of a rule
+are tricky and used only for special purposes (see section <A HREF="bison.html#SEC48">Actions in Mid-Rule</A>).
+The C code in an action can refer to the semantic values of the components
+matched by the rule with the construct <CODE>$<VAR>n</VAR></CODE>, which stands for
+the value of the <VAR>n</VAR>th component.  The semantic value for the grouping
+being constructed is <CODE>$$</CODE>.  (Bison translates both of these constructs
+into array element references when it copies the actions into the parser
+file.)
+Here is a typical example:
+<PRE>
+exp:    ...
+        | exp '+' exp
+            { $$ = $1 + $3; }
+</PRE>
+<P>
+This rule constructs an <CODE>exp</CODE> from two smaller <CODE>exp</CODE> groupings
+connected by a plus-sign token.  In the action, <CODE>$1</CODE> and <CODE>$3</CODE>
+refer to the semantic values of the two component <CODE>exp</CODE> groupings,
+which are the first and third symbols on the right hand side of the rule.
+The sum is stored into <CODE>$$</CODE> so that it becomes the semantic value of
+the addition-expression just recognized by the rule.  If there were a
+useful semantic value associated with the <SAMP>`+'</SAMP> token, it could be
+referred to as <CODE>$2</CODE>.
+<A NAME="IDX82"></A>
+If you don't specify an action for a rule, Bison supplies a default:
+<CODE>$$ = $1</CODE>.  Thus, the value of the first symbol in the rule becomes
+the value of the whole rule.  Of course, the default rule is valid only
+if the two data types match.  There is no meaningful default action for
+an empty rule; every empty rule must have an explicit action unless the
+rule's value does not matter.
+<CODE>$<VAR>n</VAR></CODE> with <VAR>n</VAR> zero or negative is allowed for reference
+to tokens and groupings on the stack <EM>before</EM> those that match the
+current rule.  This is a very risky practice, and to use it reliably
+you must be certain of the context in which the rule is applied.  Here
+is a case in which you can use this reliably:
+<PRE>
+foo:      expr bar '+' expr  { ... }
+        | expr bar '-' expr  { ... }
+        ;
+bar:      /* empty */
+        { previous_expr = $0; }
+        ;
+</PRE>
+<P>
+As long as <CODE>bar</CODE> is used only in the fashion shown here, <CODE>$0</CODE>
+always refers to the <CODE>expr</CODE> which precedes <CODE>bar</CODE> in the
+definition of <CODE>foo</CODE>.
+<H3><A NAME="SEC47" HREF="bison.html#TOC47">Data Types of Values in Actions</A></H3>
+<P>
+<A NAME="IDX83"></A>
+<A NAME="IDX84"></A>
+If you have chosen a single data type for semantic values, the <CODE>$$</CODE>
+and <CODE>$<VAR>n</VAR></CODE> constructs always have that data type.
+If you have used <CODE>%union</CODE> to specify a variety of data types, then you
+must declare a choice among these types for each terminal or nonterminal
+symbol that can have a semantic value.  Then each time you use <CODE>$$</CODE> or
+<CODE>$<VAR>n</VAR></CODE>, its data type is determined by which symbol it refers to
+in the rule.  In this example,
+<PRE>
+exp:    ...
+        | exp '+' exp
+            { $$ = $1 + $3; }
+</PRE>
+<P>
+<CODE>$1</CODE> and <CODE>$3</CODE> refer to instances of <CODE>exp</CODE>, so they all
+have the data type declared for the nonterminal symbol <CODE>exp</CODE>.  If
+<CODE>$2</CODE> were used, it would have the data type declared for the
+terminal symbol <CODE>'+'</CODE>, whatever that might be.
+Alternatively, you can specify the data type when you refer to the value,
+by inserting <SAMP>`&#60;<VAR>type</VAR>&#62;'</SAMP> after the <SAMP>`$'</SAMP> at the beginning of the
+reference.  For example, if you have defined types as shown here:
+<PRE>
+%union {
+  int itype;
+  double dtype;
+}
+</PRE>
+<P>
+then you can write <CODE>$&#60;itype&#62;1</CODE> to refer to the first subunit of the
+rule as an integer, or <CODE>$&#60;dtype&#62;1</CODE> to refer to it as a double.
+<H3><A NAME="SEC48" HREF="bison.html#TOC48">Actions in Mid-Rule</A></H3>
+<P>
+<A NAME="IDX85"></A>
+<A NAME="IDX86"></A>
+Occasionally it is useful to put an action in the middle of a rule.
+These actions are written just like usual end-of-rule actions, but they
+are executed before the parser even recognizes the following components.
+A mid-rule action may refer to the components preceding it using
+<CODE>$<VAR>n</VAR></CODE>, but it may not refer to subsequent components because
+it is run before they are parsed.
+The mid-rule action itself counts as one of the components of the rule.
+This makes a difference when there is another action later in the same rule
+(and usually there is another at the end): you have to count the actions
+along with the symbols when working out which number <VAR>n</VAR> to use in
+<CODE>$<VAR>n</VAR></CODE>.
+The mid-rule action can also have a semantic value.  The action can set
+its value with an assignment to <CODE>$$</CODE>, and actions later in the rule
+can refer to the value using <CODE>$<VAR>n</VAR></CODE>.  Since there is no symbol
+to name the action, there is no way to declare a data type for the value
+in advance, so you must use the <SAMP>`$&#60;...&#62;'</SAMP> construct to specify a
+data type each time you refer to this value.
+There is no way to set the value of the entire rule with a mid-rule
+action, because assignments to <CODE>$$</CODE> do not have that effect.  The
+only way to set the value for the entire rule is with an ordinary action
+at the end of the rule.
+Here is an example from a hypothetical compiler, handling a <CODE>let</CODE>
+statement that looks like <SAMP>`let (<VAR>variable</VAR>) <VAR>statement</VAR>'</SAMP> and
+serves to create a variable named <VAR>variable</VAR> temporarily for the
+duration of <VAR>statement</VAR>.  To parse this construct, we must put
+<VAR>variable</VAR> into the symbol table while <VAR>statement</VAR> is parsed, then
+remove it afterward.  Here is how it is done:
+<PRE>
+stmt:   LET '(' var ')'
+                { $&#60;context&#62;$ = push_context ();
+                  declare_variable ($3); }
+        stmt    { $$ = $6;
+                  pop_context ($&#60;context&#62;5); }
+</PRE>
+<P>
+As soon as <SAMP>`let (<VAR>variable</VAR>)'</SAMP> has been recognized, the first
+action is run.  It saves a copy of the current semantic context (the
+list of accessible variables) as its semantic value, using alternative
+<CODE>context</CODE> in the data-type union.  Then it calls
+<CODE>declare_variable</CODE> to add the new variable to that list.  Once the
+first action is finished, the embedded statement <CODE>stmt</CODE> can be
+parsed.  Note that the mid-rule action is component number 5, so the
+<SAMP>`stmt'</SAMP> is component number 6.
+After the embedded statement is parsed, its semantic value becomes the
+value of the entire <CODE>let</CODE>-statement.  Then the semantic value from the
+earlier action is used to restore the prior list of variables.  This
+removes the temporary <CODE>let</CODE>-variable from the list so that it won't
+appear to exist while the rest of the program is parsed.
+Taking action before a rule is completely recognized often leads to
+conflicts since the parser must commit to a parse in order to execute the
+action.  For example, the following two rules, without mid-rule actions,
+can coexist in a working parser because the parser can shift the open-brace
+token and look at what follows before deciding whether there is a
+declaration or not:
+<PRE>
+compound: '{' declarations statements '}'
+        | '{' statements '}'
+        ;
+</PRE>
+<P>
+But when we add a mid-rule action as follows, the rules become nonfunctional:
+<PRE>
+compound: { prepare_for_local_variables (); }
+          '{' declarations statements '}'
+        | '{' statements '}'
+        ;
+</PRE>
+<P>
+Now the parser is forced to decide whether to run the mid-rule action
+when it has read no farther than the open-brace.  In other words, it
+must commit to using one rule or the other, without sufficient
+information to do it correctly.  (The open-brace token is what is called
+the <EM>look-ahead</EM> token at this time, since the parser is still
+deciding what to do about it.  See section <A HREF="bison.html#SEC69">Look-Ahead Tokens</A>.)
+You might think that you could correct the problem by putting identical
+actions into the two rules, like this:
+<PRE>
+compound: { prepare_for_local_variables (); }
+          '{' declarations statements '}'
+        | { prepare_for_local_variables (); }
+          '{' statements '}'
+        ;
+</PRE>
+<P>
+But this does not help, because Bison does not realize that the two actions
+are identical.  (Bison never tries to understand the C code in an action.)
+If the grammar is such that a declaration can be distinguished from a
+statement by the first token (which is true in C), then one solution which
+does work is to put the action after the open-brace, like this:
+<PRE>
+compound: '{' { prepare_for_local_variables (); }
+          declarations statements '}'
+        | '{' statements '}'
+        ;
+</PRE>
+<P>
+Now the first token of the following declaration or statement,
+which would in any case tell Bison which rule to use, can still do so.
+Another solution is to bury the action inside a nonterminal symbol which
+serves as a subroutine:
+<PRE>
+subroutine: /* empty */
+          { prepare_for_local_variables (); }
+        ;
+compound: subroutine
+          '{' declarations statements '}'
+        | subroutine
+          '{' statements '}'
+        ;
+</PRE>
+<P>
+Now Bison can execute the action in the rule for <CODE>subroutine</CODE> without
+deciding which rule for <CODE>compound</CODE> it will eventually use.  Note that
+the action is now at the end of its rule.  Any mid-rule action can be
+converted to an end-of-rule action in this way, and this is what Bison
+actually does to implement mid-rule actions.
+<H2><A NAME="SEC49" HREF="bison.html#TOC49">Bison Declarations</A></H2>
+<P>
+<A NAME="IDX87"></A>
+<A NAME="IDX88"></A>
+The <EM>Bison declarations</EM> section of a Bison grammar defines the symbols
+used in formulating the grammar and the data types of semantic values.
+See section <A HREF="bison.html#SEC40">Symbols, Terminal and Nonterminal</A>.
+All token type names (but not single-character literal tokens such as
+<CODE>'+'</CODE> and <CODE>'*'</CODE>) must be declared.  Nonterminal symbols must be
+declared if you need to specify which data type to use for the semantic
+value (see section <A HREF="bison.html#SEC45">More Than One Value Type</A>).
+The first rule in the file also specifies the start symbol, by default.
+If you want some other symbol to be the start symbol, you must declare
+it explicitly (see section <A HREF="bison.html#SEC8">Languages and Context-Free Grammars</A>).
+<H3><A NAME="SEC50" HREF="bison.html#TOC50">Token Type Names</A></H3>
+<P>
+<A NAME="IDX89"></A>
+<A NAME="IDX90"></A>
+<A NAME="IDX91"></A>
+The basic way to declare a token type name (terminal symbol) is as follows:
+<PRE>
+%token <VAR>name</VAR>
+</PRE>
+<P>
+Bison will convert this into a <CODE>#define</CODE> directive in
+the parser, so that the function <CODE>yylex</CODE> (if it is in this file)
+can use the name <VAR>name</VAR> to stand for this token type's code.
+Alternatively, you can use <CODE>%left</CODE>, <CODE>%right</CODE>, or <CODE>%nonassoc</CODE>
+instead of <CODE>%token</CODE>, if you wish to specify precedence.
+See section <A HREF="bison.html#SEC51">Operator Precedence</A>.
+You can explicitly specify the numeric code for a token type by appending
+an integer value in the field immediately following the token name:
+<PRE>
+%token NUM 300
+</PRE>
+<P>
+It is generally best, however, to let Bison choose the numeric codes for
+all token types.  Bison will automatically select codes that don't conflict
+with each other or with ASCII characters.
+In the event that the stack type is a union, you must augment the
+<CODE>%token</CODE> or other token declaration to include the data type
+alternative delimited by angle-brackets (see section <A HREF="bison.html#SEC45">More Than One Value Type</A>).  
+For example:
+<PRE>
+%union {              /* define stack type */
+  double val;
+  symrec *tptr;
+}
+%token &#60;val&#62; NUM      /* define token NUM and its type */
+</PRE>
+<P>
+<H3><A NAME="SEC51" HREF="bison.html#TOC51">Operator Precedence</A></H3>
+<P>
+<A NAME="IDX92"></A>
+<A NAME="IDX93"></A>
+<A NAME="IDX94"></A>
+Use the <CODE>%left</CODE>, <CODE>%right</CODE> or <CODE>%nonassoc</CODE> declaration to
+declare a token and specify its precedence and associativity, all at
+once.  These are called <EM>precedence declarations</EM>.
+See section <A HREF="bison.html#SEC71">Operator Precedence</A>, for general information on operator precedence.
+The syntax of a precedence declaration is the same as that of
+<CODE>%token</CODE>: either
+<PRE>
+%left <VAR>symbols</VAR>...
+</PRE>
+<P>
+or
+<PRE>
+%left &#60;<VAR>type</VAR>&#62; <VAR>symbols</VAR>...
+</PRE>
+<P>
+And indeed any of these declarations serves the purposes of <CODE>%token</CODE>.
+But in addition, they specify the associativity and relative precedence for
+all the <VAR>symbols</VAR>:
+<UL>
+<LI>
+The associativity of an operator <VAR>op</VAR> determines how repeated uses
+of the operator nest: whether <SAMP>`<VAR>x</VAR> <VAR>op</VAR> <VAR>y</VAR> <VAR>op</VAR>
+<VAR>z</VAR>'</SAMP> is parsed by grouping <VAR>x</VAR> with <VAR>y</VAR> first or by
+grouping <VAR>y</VAR> with <VAR>z</VAR> first.  <CODE>%left</CODE> specifies
+left-associativity (grouping <VAR>x</VAR> with <VAR>y</VAR> first) and
+<CODE>%right</CODE> specifies right-associativity (grouping <VAR>y</VAR> with
+<VAR>z</VAR> first).  <CODE>%nonassoc</CODE> specifies no associativity, which
+means that <SAMP>`<VAR>x</VAR> <VAR>op</VAR> <VAR>y</VAR> <VAR>op</VAR> <VAR>z</VAR>'</SAMP> is
+considered a syntax error.
+<LI>
+The precedence of an operator determines how it nests with other operators.
+All the tokens declared in a single precedence declaration have equal
+precedence and nest together according to their associativity.
+When two tokens declared in different precedence declarations associate,
+the one declared later has the higher precedence and is grouped first.
+</UL>
+<P>
+<H3><A NAME="SEC52" HREF="bison.html#TOC52">The Collection of Value Types</A></H3>
+<P>
+<A NAME="IDX95"></A>
+<A NAME="IDX96"></A>
+<A NAME="IDX97"></A>
+The <CODE>%union</CODE> declaration specifies the entire collection of possible
+data types for semantic values.  The keyword <CODE>%union</CODE> is followed by a
+pair of braces containing the same thing that goes inside a <CODE>union</CODE> in
+C.  
+For example:
+<PRE>
+%union {
+  double val;
+  symrec *tptr;
+}
+</PRE>
+<P>
+This says that the two alternative types are <CODE>double</CODE> and <CODE>symrec
+*</CODE>.  They are given names <CODE>val</CODE> and <CODE>tptr</CODE>; these names are used
+in the <CODE>%token</CODE> and <CODE>%type</CODE> declarations to pick one of the types
+for a terminal or nonterminal symbol (see section <A HREF="bison.html#SEC53">Nonterminal Symbols</A>).
+Note that, unlike making a <CODE>union</CODE> declaration in C, you do not write
+a semicolon after the closing brace.
+<H3><A NAME="SEC53" HREF="bison.html#TOC53">Nonterminal Symbols</A></H3>
+<P>
+<A NAME="IDX98"></A>
+<A NAME="IDX99"></A>
+<A NAME="IDX100"></A>
+When you use <CODE>%union</CODE> to specify multiple value types, you must
+declare the value type of each nonterminal symbol for which values are
+used.  This is done with a <CODE>%type</CODE> declaration, like this:
+<PRE>
+%type &#60;<VAR>type</VAR>&#62; <VAR>nonterminal</VAR>...
+</PRE>
+<P>
+Here <VAR>nonterminal</VAR> is the name of a nonterminal symbol, and <VAR>type</VAR>
+is the name given in the <CODE>%union</CODE> to the alternative that you want
+(see section <A HREF="bison.html#SEC52">The Collection of Value Types</A>).  You can give any number of nonterminal symbols in
+the same <CODE>%type</CODE> declaration, if they have the same value type.  Use
+spaces to separate the symbol names.
+<H3><A NAME="SEC54" HREF="bison.html#TOC54">Suppressing Conflict Warnings</A></H3>
+<P>
+<A NAME="IDX101"></A>
+<A NAME="IDX102"></A>
+<A NAME="IDX103"></A>
+<A NAME="IDX104"></A>
+<A NAME="IDX105"></A>
+Bison normally warns if there are any conflicts in the grammar
+(see section <A HREF="bison.html#SEC70">Shift/Reduce Conflicts</A>), but most real grammars have harmless shift/reduce
+conflicts which are resolved in a predictable way and would be difficult to
+eliminate.  It is desirable to suppress the warning about these conflicts
+unless the number of conflicts changes.  You can do this with the
+<CODE>%expect</CODE> declaration.
+The declaration looks like this:
+<PRE>
+%expect <VAR>n</VAR>
+</PRE>
+<P>
+Here <VAR>n</VAR> is a decimal integer.  The declaration says there should be no
+warning if there are <VAR>n</VAR> shift/reduce conflicts and no reduce/reduce
+conflicts.  The usual warning is given if there are either more or fewer
+conflicts, or if there are any reduce/reduce conflicts.
+In general, using <CODE>%expect</CODE> involves these steps:
+<UL>
+<LI>
+Compile your grammar without <CODE>%expect</CODE>.  Use the <SAMP>`-v'</SAMP> option
+to get a verbose list of where the conflicts occur.  Bison will also
+print the number of conflicts.
+<LI>
+Check each of the conflicts to make sure that Bison's default
+resolution is what you really want.  If not, rewrite the grammar and
+go back to the beginning.
+<LI>
+Add an <CODE>%expect</CODE> declaration, copying the number <VAR>n</VAR> from the
+number which Bison printed.
+</UL>
+<P>
+Now Bison will stop annoying you about the conflicts you have checked, but
+it will warn you again if changes in the grammar result in additional
+conflicts.
+<H3><A NAME="SEC55" HREF="bison.html#TOC55">The Start-Symbol</A></H3>
+<P>
+<A NAME="IDX106"></A>
+<A NAME="IDX107"></A>
+<A NAME="IDX108"></A>
+<A NAME="IDX109"></A>
+Bison assumes by default that the start symbol for the grammar is the first
+nonterminal specified in the grammar specification section.  The programmer
+may override this restriction with the <CODE>%start</CODE> declaration as follows:
+<PRE>
+%start <VAR>symbol</VAR>
+</PRE>
+<P>
+<H3><A NAME="SEC56" HREF="bison.html#TOC56">A Pure (Reentrant) Parser</A></H3>
+<P>
+<A NAME="IDX110"></A>
+<A NAME="IDX111"></A>
+<A NAME="IDX112"></A>
+A <EM>reentrant</EM> program is one which does not alter in the course of
+execution; in other words, it consists entirely of <EM>pure</EM> (read-only)
+code.  Reentrancy is important whenever asynchronous execution is possible;
+for example, a nonreentrant program may not be safe to call from a signal
+handler.  In systems with multiple threads of control, a nonreentrant
+program must be called only within interlocks.
+The Bison parser is not normally a reentrant program, because it uses
+statically allocated variables for communication with <CODE>yylex</CODE>.  These
+variables include <CODE>yylval</CODE> and <CODE>yylloc</CODE>.
+The Bison declaration <CODE>%pure_parser</CODE> says that you want the parser
+to be reentrant.  It looks like this:
+<PRE>
+%pure_parser
+</PRE>
+<P>
+The effect is that the two communication variables become local
+variables in <CODE>yyparse</CODE>, and a different calling convention is used
+for the lexical analyzer function <CODE>yylex</CODE>.  See section <A HREF="bison.html#SEC65">Calling Conventions for Pure Parsers</A>, for the details of this.  The
+variable <CODE>yynerrs</CODE> also becomes local in <CODE>yyparse</CODE>
+(see section <A HREF="bison.html#SEC66">The Error Reporting Function <CODE>yyerror</CODE></A>).
+The convention for calling <CODE>yyparse</CODE> itself is unchanged.
+<H3><A NAME="SEC57" HREF="bison.html#TOC57">Bison Declaration Summary</A></H3>
+<P>
+<A NAME="IDX113"></A>
+<A NAME="IDX114"></A>
+<A NAME="IDX115"></A>
+Here is a summary of all Bison declarations:
+<DL COMPACT>
+<DT><CODE>%union</CODE>
+<DD>
+Declare the collection of data types that semantic values may have
+(see section <A HREF="bison.html#SEC52">The Collection of Value Types</A>).
+<DT><CODE>%token</CODE>
+<DD>
+Declare a terminal symbol (token type name) with no precedence
+or associativity specified (see section <A HREF="bison.html#SEC50">Token Type Names</A>).
+<DT><CODE>%right</CODE>
+<DD>
+Declare a terminal symbol (token type name) that is right-associative
+(see section <A HREF="bison.html#SEC51">Operator Precedence</A>).
+<DT><CODE>%left</CODE>
+<DD>
+Declare a terminal symbol (token type name) that is left-associative
+(see section <A HREF="bison.html#SEC51">Operator Precedence</A>).
+<DT><CODE>%nonassoc</CODE>
+<DD>
+Declare a terminal symbol (token type name) that is nonassociative
+(using it in a way that would be associative is a syntax error)
+(see section <A HREF="bison.html#SEC51">Operator Precedence</A>).
+<DT><CODE>%type</CODE>
+<DD>
+Declare the type of semantic values for a nonterminal symbol
+(see section <A HREF="bison.html#SEC53">Nonterminal Symbols</A>).
+<DT><CODE>%start</CODE>
+<DD>
+Specify the grammar's start symbol (see section <A HREF="bison.html#SEC55">The Start-Symbol</A>).
+<DT><CODE>%expect</CODE>
+<DD>
+Declare the expected number of shift-reduce conflicts
+(see section <A HREF="bison.html#SEC54">Suppressing Conflict Warnings</A>).
+<DT><CODE>%pure_parser</CODE>
+<DD>
+Request a pure (reentrant) parser program (see section <A HREF="bison.html#SEC56">A Pure (Reentrant) Parser</A>).
+</DL>
+<P>
+<H2><A NAME="SEC58" HREF="bison.html#TOC58">Multiple Parsers in the Same Program</A></H2>
+<P>
+Most programs that use Bison parse only one language and therefore contain
+only one Bison parser.  But what if you want to parse more than one
+language with the same program?  Then you need to avoid a name conflict
+between different definitions of <CODE>yyparse</CODE>, <CODE>yylval</CODE>, and so on.
+The easy way to do this is to use the option <SAMP>`-p <VAR>prefix</VAR>'</SAMP>
+(see section <A HREF="bison.html#SEC87">Invoking Bison</A>).  This renames the interface functions and
+variables of the Bison parser to start with <VAR>prefix</VAR> instead of
+<SAMP>`yy'</SAMP>.  You can use this to give each parser distinct names that do
+not conflict.
+The precise list of symbols renamed is <CODE>yyparse</CODE>, <CODE>yylex</CODE>,
+<CODE>yyerror</CODE>, <CODE>yynerrs</CODE>, <CODE>yylval</CODE>, <CODE>yychar</CODE> and
+<CODE>yydebug</CODE>.  For example, if you use <SAMP>`-p c'</SAMP>, the names become
+<CODE>cparse</CODE>, <CODE>clex</CODE>, and so on.
+<STRONG>All the other variables and macros associated with Bison are not
+renamed.</STRONG> These others are not global; there is no conflict if the same
+name is used in different parsers.  For example, <CODE>YYSTYPE</CODE> is not
+renamed, but defining this in different ways in different parsers causes
+no trouble (see section <A HREF="bison.html#SEC44">Data Types of Semantic Values</A>).
+The <SAMP>`-p'</SAMP> option works by adding macro definitions to the beginning
+of the parser source file, defining <CODE>yyparse</CODE> as
+<CODE><VAR>prefix</VAR>parse</CODE>, and so on.  This effectively substitutes one
+name for the other in the entire parser file.
+<H1><A NAME="SEC59" HREF="bison.html#TOC59">Parser C-Language Interface</A></H1>
+<P>
+<A NAME="IDX116"></A>
+<A NAME="IDX117"></A>
+The Bison parser is actually a C function named <CODE>yyparse</CODE>.  Here we
+describe the interface conventions of <CODE>yyparse</CODE> and the other
+functions that it needs to use.
+Keep in mind that the parser uses many C identifiers starting with
+<SAMP>`yy'</SAMP> and <SAMP>`YY'</SAMP> for internal purposes.  If you use such an
+identifier (aside from those in this manual) in an action or in additional
+C code in the grammar file, you are likely to run into trouble.
+<H2><A NAME="SEC60" HREF="bison.html#TOC60">The Parser Function <CODE>yyparse</CODE></A></H2>
+<P>
+<A NAME="IDX118"></A>
+You call the function <CODE>yyparse</CODE> to cause parsing to occur.  This
+function reads tokens, executes actions, and ultimately returns when it
+encounters end-of-input or an unrecoverable syntax error.  You can also
+write an action which directs <CODE>yyparse</CODE> to return immediately without
+reading further.
+The value returned by <CODE>yyparse</CODE> is 0 if parsing was successful (return
+is due to end-of-input).
+The value is 1 if parsing failed (return is due to a syntax error).
+In an action, you can cause immediate return from <CODE>yyparse</CODE> by using
+these macros:
+<DL COMPACT>
+<DT><CODE>YYACCEPT</CODE>
+<DD>
+<A NAME="IDX119"></A>
+Return immediately with value 0 (to report success).
+<DT><CODE>YYABORT</CODE>
+<DD>
+<A NAME="IDX120"></A>
+Return immediately with value 1 (to report failure).
+</DL>
+<P>
+<H2><A NAME="SEC61" HREF="bison.html#TOC61">The Lexical Analyzer Function <CODE>yylex</CODE></A></H2>
+<P>
+<A NAME="IDX121"></A>
+<A NAME="IDX122"></A>
+The <EM>lexical analyzer</EM> function, <CODE>yylex</CODE>, recognizes tokens from
+the input stream and returns them to the parser.  Bison does not create
+this function automatically; you must write it so that <CODE>yyparse</CODE> can
+call it.  The function is sometimes referred to as a lexical scanner.
+In simple programs, <CODE>yylex</CODE> is often defined at the end of the Bison
+grammar file.  If <CODE>yylex</CODE> is defined in a separate source file, you
+need to arrange for the token-type macro definitions to be available there.
+To do this, use the <SAMP>`-d'</SAMP> option when you run Bison, so that it will
+write these macro definitions into a separate header file
+<TT>`<VAR>name</VAR>.tab.h'</TT> which you can include in the other source files
+that need it.  See section <A HREF="bison.html#SEC87">Invoking Bison</A>.
+<H3><A NAME="SEC62" HREF="bison.html#TOC62">Calling Convention for <CODE>yylex</CODE></A></H3>
+<P>
+The value that <CODE>yylex</CODE> returns must be the numeric code for the type
+of token it has just found, or 0 for end-of-input.
+When a token is referred to in the grammar rules by a name, that name
+in the parser file becomes a C macro whose definition is the proper
+numeric code for that token type.  So <CODE>yylex</CODE> can use the name
+to indicate that type.  See section <A HREF="bison.html#SEC40">Symbols, Terminal and Nonterminal</A>.
+When a token is referred to in the grammar rules by a character literal,
+the numeric code for that character is also the code for the token type.
+So <CODE>yylex</CODE> can simply return that character code.  The null character
+must not be used this way, because its code is zero and that is what
+signifies end-of-input.
+Here is an example showing these things:
+<PRE>
+yylex ()
+{
+  ...
+  if (c == EOF)     /* Detect end of file. */
+    return 0;
+  ...
+  if (c == '+' || c == '-')
+    return c;      /* Assume token type for `+' is '+'. */
+  ...
+  return INT;      /* Return the type of the token. */
+  ...
+}
+</PRE>
+<P>
+This interface has been designed so that the output from the <CODE>lex</CODE>
+utility can be used without change as the definition of <CODE>yylex</CODE>.
+<H3><A NAME="SEC63" HREF="bison.html#TOC63">Semantic Values of Tokens</A></H3>
+<P>
+<A NAME="IDX123"></A>
+In an ordinary (nonreentrant) parser, the semantic value of the token must
+be stored into the global variable <CODE>yylval</CODE>.  When you are using
+just one data type for semantic values, <CODE>yylval</CODE> has that type.
+Thus, if the type is <CODE>int</CODE> (the default), you might write this in
+<CODE>yylex</CODE>:
+<PRE>
+  ...
+  yylval = value;  /* Put value onto Bison stack. */
+  return INT;      /* Return the type of the token. */
+  ...
+</PRE>
+<P>
+When you are using multiple data types, <CODE>yylval</CODE>'s type is a union
+made from the <CODE>%union</CODE> declaration (see section <A HREF="bison.html#SEC52">The Collection of Value Types</A>).  So when
+you store a token's value, you must use the proper member of the union.
+If the <CODE>%union</CODE> declaration looks like this:
+<PRE>
+%union {
+  int intval;
+  double val;
+  symrec *tptr;
+}
+</PRE>
+<P>
+then the code in <CODE>yylex</CODE> might look like this:
+<PRE>
+  ...
+  yylval.intval = value; /* Put value onto Bison stack. */
+  return INT;          /* Return the type of the token. */
+  ...
+</PRE>
+<P>
+<H3><A NAME="SEC64" HREF="bison.html#TOC64">Textual Positions of Tokens</A></H3>
+<P>
+<A NAME="IDX124"></A>
+If you are using the <SAMP>`@<VAR>n</VAR>'</SAMP>-feature (see section <A HREF="bison.html#SEC67">Special Features for Use in Actions</A>) in
+actions to keep track of the textual locations of tokens and groupings,
+then you must provide this information in <CODE>yylex</CODE>.  The function
+<CODE>yyparse</CODE> expects to find the textual location of a token just parsed
+in the global variable <CODE>yylloc</CODE>.  So <CODE>yylex</CODE> must store the
+proper data in that variable.  The value of <CODE>yylloc</CODE> is a structure
+and you need only initialize the members that are going to be used by the
+actions.  The four members are called <CODE>first_line</CODE>,
+<CODE>first_column</CODE>, <CODE>last_line</CODE> and <CODE>last_column</CODE>.  Note that
+the use of this feature makes the parser noticeably slower.
+<A NAME="IDX125"></A>
+The data type of <CODE>yylloc</CODE> has the name <CODE>YYLTYPE</CODE>.
+<H3><A NAME="SEC65" HREF="bison.html#TOC65">Calling Conventions for Pure Parsers</A></H3>
+<P>
+When you use the Bison declaration <CODE>%pure_parser</CODE> to request a
+pure, reentrant parser, the global communication variables <CODE>yylval</CODE>
+and <CODE>yylloc</CODE> cannot be used.  (See section <A HREF="bison.html#SEC56">A Pure (Reentrant) Parser</A>.)  In such parsers the two global variables are replaced by
+pointers passed as arguments to <CODE>yylex</CODE>.  You must declare them as
+shown here, and pass the information back by storing it through those
+pointers.
+<PRE>
+yylex (lvalp, llocp)
+     YYSTYPE *lvalp;
+     YYLTYPE *llocp;
+{
+  ...
+  *lvalp = value;  /* Put value onto Bison stack.  */
+  return INT;      /* Return the type of the token.  */
+  ...
+}
+</PRE>
+<P>
+If the grammar file does not use the <SAMP>`@'</SAMP> constructs to refer to
+textual positions, then the type <CODE>YYLTYPE</CODE> will not be defined.  In
+this case, omit the second argument; <CODE>yylex</CODE> will be called with
+only one argument.
+<A NAME="IDX126"></A>
+You can pass parameter information to a reentrant parser in a reentrant
+way.  Define the macro <CODE>YYPARSE_PARAM</CODE> as a variable name.  The
+resulting <CODE>yyparse</CODE> function then accepts one argument, of type
+<CODE>void *</CODE>, with that name.
+When you call <CODE>yyparse</CODE>, pass the address of an object, casting the
+address to <CODE>void *</CODE>.  The grammar actions can refer to the contents
+of the object by casting the pointer value back to its proper type and
+then dereferencing it.  Here's an example.  Write this in the parser:
+<PRE>
+%{
+struct parser_control
+{
+  int nastiness;
+  int randomness;
+};
+#define YYPARSE_PARAM parm
+%}
+</PRE>
+<P>
+Then call the parser like this:
+<PRE>
+struct parser_control
+{
+  int nastiness;
+  int randomness;
+};
+...
+{
+  struct parser_control foo;
+  ...  /* Store proper data in <CODE>foo</CODE>.  */
+  value = yyparse ((void *) &#38;foo);
+  ...
+}
+</PRE>
+<P>
+In the grammar actions, use expressions like this to refer to the data:
+<PRE>
+((struct parser_control *) parm)-&#62;randomness
+</PRE>
+<P>
+<A NAME="IDX127"></A>
+If you wish to pass the additional parameter data to <CODE>yylex</CODE>,
+define the macro <CODE>YYLEX_PARAM</CODE> just like <CODE>YYPARSE_PARAM</CODE>, as
+shown here:
+<PRE>
+%{
+struct parser_control
+{
+  int nastiness;
+  int randomness;
+};
+#define YYPARSE_PARAM parm
+#define YYLEX_PARAM parm
+%}
+</PRE>
+<P>
+You should then define <CODE>yylex</CODE> to accept one additional
+argument--the value of <CODE>parm</CODE>.  (This makes either two or three
+arguments in total, depending on whether an argument of type
+<CODE>YYLTYPE</CODE> is passed.)  You can declare the argument as a pointer to
+the proper object type, or you can declare it as <CODE>void *</CODE> and
+access the contents as shown above.
+<H2><A NAME="SEC66" HREF="bison.html#TOC66">The Error Reporting Function <CODE>yyerror</CODE></A></H2>
+<P>
+<A NAME="IDX128"></A>
+<A NAME="IDX129"></A>
+<A NAME="IDX130"></A>
+<A NAME="IDX131"></A>
+The Bison parser detects a <EM>parse error</EM> or <EM>syntax error</EM>
+whenever it reads a token which cannot satisfy any syntax rule.  A
+action in the grammar can also explicitly proclaim an error, using the
+macro <CODE>YYERROR</CODE> (see section <A HREF="bison.html#SEC67">Special Features for Use in Actions</A>).
+The Bison parser expects to report the error by calling an error
+reporting function named <CODE>yyerror</CODE>, which you must supply.  It is
+called by <CODE>yyparse</CODE> whenever a syntax error is found, and it
+receives one argument.  For a parse error, the string is normally
+<CODE>"parse error"</CODE>.
+<A NAME="IDX132"></A>
+If you define the macro <CODE>YYERROR_VERBOSE</CODE> in the Bison declarations
+section (see section <A HREF="bison.html#SEC37">The Bison Declarations Section</A>), then Bison provides a more verbose
+and specific error message string instead of just plain <CODE>"parse
+error"</CODE>.  It doesn't matter what definition you use for
+<CODE>YYERROR_VERBOSE</CODE>, just whether you define it.
+The parser can detect one other kind of error: stack overflow.  This
+happens when the input contains constructions that are very deeply
+nested.  It isn't likely you will encounter this, since the Bison
+parser extends its stack automatically up to a very large limit.  But
+if overflow happens, <CODE>yyparse</CODE> calls <CODE>yyerror</CODE> in the usual
+fashion, except that the argument string is <CODE>"parser stack
+overflow"</CODE>.
+The following definition suffices in simple programs:
+<PRE>
+yyerror (s)
+     char *s;
+{
+  fprintf (stderr, "%s\n", s);
+}
+</PRE>
+<P>
+After <CODE>yyerror</CODE> returns to <CODE>yyparse</CODE>, the latter will attempt
+error recovery if you have written suitable error recovery grammar rules
+(see section <A HREF="bison.html#SEC81">Error Recovery</A>).  If recovery is impossible, <CODE>yyparse</CODE> will
+immediately return 1.
+<A NAME="IDX133"></A>
+The variable <CODE>yynerrs</CODE> contains the number of syntax errors
+encountered so far.  Normally this variable is global; but if you
+request a pure parser (see section <A HREF="bison.html#SEC56">A Pure (Reentrant) Parser</A>) then it is a local variable
+which only the actions can access.
+<H2><A NAME="SEC67" HREF="bison.html#TOC67">Special Features for Use in Actions</A></H2>
+<P>
+<A NAME="IDX134"></A>
+<A NAME="IDX135"></A>
+Here is a table of Bison constructs, variables and macros that
+are useful in actions.
+<DL COMPACT>
+<DT><SAMP>`$$'</SAMP>
+<DD>
+Acts like a variable that contains the semantic value for the
+grouping made by the current rule.  See section <A HREF="bison.html#SEC46">Actions</A>.
+<DT><SAMP>`$<VAR>n</VAR>'</SAMP>
+<DD>
+Acts like a variable that contains the semantic value for the
+<VAR>n</VAR>th component of the current rule.  See section <A HREF="bison.html#SEC46">Actions</A>.
+<DT><SAMP>`$&#60;<VAR>typealt</VAR>&#62;$'</SAMP>
+<DD>
+Like <CODE>$$</CODE> but specifies alternative <VAR>typealt</VAR> in the union
+specified by the <CODE>%union</CODE> declaration.  See section <A HREF="bison.html#SEC47">Data Types of Values in Actions</A>.
+<DT><SAMP>`$&#60;<VAR>typealt</VAR>&#62;<VAR>n</VAR>'</SAMP>
+<DD>
+Like <CODE>$<VAR>n</VAR></CODE> but specifies alternative <VAR>typealt</VAR> in the
+union specified by the <CODE>%union</CODE> declaration.  
+See section <A HREF="bison.html#SEC47">Data Types of Values in Actions</A>.
+<DT><SAMP>`YYABORT;'</SAMP>
+<DD>
+Return immediately from <CODE>yyparse</CODE>, indicating failure.
+See section <A HREF="bison.html#SEC60">The Parser Function <CODE>yyparse</CODE></A>.
+<DT><SAMP>`YYACCEPT;'</SAMP>
+<DD>
+Return immediately from <CODE>yyparse</CODE>, indicating success.
+See section <A HREF="bison.html#SEC60">The Parser Function <CODE>yyparse</CODE></A>.
+<DT><SAMP>`YYBACKUP (<VAR>token</VAR>, <VAR>value</VAR>);'</SAMP>
+<DD>
+<A NAME="IDX136"></A>
+Unshift a token.  This macro is allowed only for rules that reduce
+a single value, and only when there is no look-ahead token.
+It installs a look-ahead token with token type <VAR>token</VAR> and
+semantic value <VAR>value</VAR>; then it discards the value that was
+going to be reduced by this rule.
+If the macro is used when it is not valid, such as when there is
+a look-ahead token already, then it reports a syntax error with
+a message <SAMP>`cannot back up'</SAMP> and performs ordinary error
+recovery.
+In either case, the rest of the action is not executed.
+<DT><SAMP>`YYEMPTY'</SAMP>
+<DD>
+<A NAME="IDX137"></A>
+Value stored in <CODE>yychar</CODE> when there is no look-ahead token.
+<DT><SAMP>`YYERROR;'</SAMP>
+<DD>
+<A NAME="IDX138"></A>
+Cause an immediate syntax error.  This statement initiates error
+recovery just as if the parser itself had detected an error; however, it
+does not call <CODE>yyerror</CODE>, and does not print any message.  If you
+want to print an error message, call <CODE>yyerror</CODE> explicitly before
+the <SAMP>`YYERROR;'</SAMP> statement.  See section <A HREF="bison.html#SEC81">Error Recovery</A>.
+<DT><SAMP>`YYRECOVERING'</SAMP>
+<DD>
+This macro stands for an expression that has the value 1 when the parser
+is recovering from a syntax error, and 0 the rest of the time.
+See section <A HREF="bison.html#SEC81">Error Recovery</A>.
+<DT><SAMP>`yychar'</SAMP>
+<DD>
+Variable containing the current look-ahead token.  (In a pure parser,
+this is actually a local variable within <CODE>yyparse</CODE>.)  When there is
+no look-ahead token, the value <CODE>YYEMPTY</CODE> is stored in the variable.
+See section <A HREF="bison.html#SEC69">Look-Ahead Tokens</A>.
+<DT><SAMP>`yyclearin;'</SAMP>
+<DD>
+Discard the current look-ahead token.  This is useful primarily in
+error rules.  See section <A HREF="bison.html#SEC81">Error Recovery</A>.
+<DT><SAMP>`yyerrok;'</SAMP>
+<DD>
+Resume generating error messages immediately for subsequent syntax
+errors.  This is useful primarily in error rules.  
+See section <A HREF="bison.html#SEC81">Error Recovery</A>.
+<DT><SAMP>`@<VAR>n</VAR>'</SAMP>
+<DD>
+<A NAME="IDX139"></A>
+Acts like a structure variable containing information on the line
+numbers and column numbers of the <VAR>n</VAR>th component of the current
+rule.  The structure has four members, like this:
+<PRE>
+struct {
+  int first_line, last_line;
+  int first_column, last_column;
+};
+</PRE>
+Thus, to get the starting line number of the third component, use
+<SAMP>`@3.first_line'</SAMP>.
+In order for the members of this structure to contain valid information,
+you must make <CODE>yylex</CODE> supply this information about each token.
+If you need only certain members, then <CODE>yylex</CODE> need only fill in
+those members.
+The use of this feature makes the parser noticeably slower.
+</DL>
+<P>
+<H1><A NAME="SEC68" HREF="bison.html#TOC68">The Bison Parser Algorithm</A></H1>
+<P>
+<A NAME="IDX140"></A>
+<A NAME="IDX141"></A>
+<A NAME="IDX142"></A>
+<A NAME="IDX143"></A>
+<A NAME="IDX144"></A>
+<A NAME="IDX145"></A>
+As Bison reads tokens, it pushes them onto a stack along with their
+semantic values.  The stack is called the <EM>parser stack</EM>.  Pushing a
+token is traditionally called <EM>shifting</EM>.
+For example, suppose the infix calculator has read <SAMP>`1 + 5 *'</SAMP>, with a
+<SAMP>`3'</SAMP> to come.  The stack will have four elements, one for each token
+that was shifted.
+But the stack does not always have an element for each token read.  When
+the last <VAR>n</VAR> tokens and groupings shifted match the components of a
+grammar rule, they can be combined according to that rule.  This is called
+<EM>reduction</EM>.  Those tokens and groupings are replaced on the stack by a
+single grouping whose symbol is the result (left hand side) of that rule.
+Running the rule's action is part of the process of reduction, because this
+is what computes the semantic value of the resulting grouping.
+For example, if the infix calculator's parser stack contains this:
+<PRE>
+1 + 5 * 3
+</PRE>
+<P>
+and the next input token is a newline character, then the last three
+elements can be reduced to 15 via the rule:
+<PRE>
+expr: expr '*' expr;
+</PRE>
+<P>
+Then the stack contains just these three elements:
+<PRE>
+1 + 15
+</PRE>
+<P>
+At this point, another reduction can be made, resulting in the single value
+16.  Then the newline token can be shifted.
+The parser tries, by shifts and reductions, to reduce the entire input down
+to a single grouping whose symbol is the grammar's start-symbol
+(see section <A HREF="bison.html#SEC8">Languages and Context-Free Grammars</A>).
+This kind of parser is known in the literature as a bottom-up parser.
+<H2><A NAME="SEC69" HREF="bison.html#TOC69">Look-Ahead Tokens</A></H2>
+<P>
+<A NAME="IDX146"></A>
+The Bison parser does <EM>not</EM> always reduce immediately as soon as the
+last <VAR>n</VAR> tokens and groupings match a rule.  This is because such a
+simple strategy is inadequate to handle most languages.  Instead, when a
+reduction is possible, the parser sometimes "looks ahead" at the next
+token in order to decide what to do.
+When a token is read, it is not immediately shifted; first it becomes the
+<EM>look-ahead token</EM>, which is not on the stack.  Now the parser can
+perform one or more reductions of tokens and groupings on the stack, while
+the look-ahead token remains off to the side.  When no more reductions
+should take place, the look-ahead token is shifted onto the stack.  This
+does not mean that all possible reductions have been done; depending on the
+token type of the look-ahead token, some rules may choose to delay their
+application.
+Here is a simple case where look-ahead is needed.  These three rules define
+expressions which contain binary addition operators and postfix unary
+factorial operators (<SAMP>`!'</SAMP>), and allow parentheses for grouping.
+<PRE>
+expr:     term '+' expr
+        | term
+        ;
+term:     '(' expr ')'
+        | term '!'
+        | NUMBER
+        ;
+</PRE>
+<P>
+Suppose that the tokens <SAMP>`1 + 2'</SAMP> have been read and shifted; what
+should be done?  If the following token is <SAMP>`)'</SAMP>, then the first three
+tokens must be reduced to form an <CODE>expr</CODE>.  This is the only valid
+course, because shifting the <SAMP>`)'</SAMP> would produce a sequence of symbols
+<CODE>term ')'</CODE>, and no rule allows this.
+If the following token is <SAMP>`!'</SAMP>, then it must be shifted immediately so
+that <SAMP>`2 !'</SAMP> can be reduced to make a <CODE>term</CODE>.  If instead the
+parser were to reduce before shifting, <SAMP>`1 + 2'</SAMP> would become an
+<CODE>expr</CODE>.  It would then be impossible to shift the <SAMP>`!'</SAMP> because
+doing so would produce on the stack the sequence of symbols <CODE>expr
+'!'</CODE>.  No rule allows that sequence.
+<A NAME="IDX147"></A>
+The current look-ahead token is stored in the variable <CODE>yychar</CODE>.
+See section <A HREF="bison.html#SEC67">Special Features for Use in Actions</A>.
+<H2><A NAME="SEC70" HREF="bison.html#TOC70">Shift/Reduce Conflicts</A></H2>
+<P>
+<A NAME="IDX148"></A>
+<A NAME="IDX149"></A>
+<A NAME="IDX150"></A>
+<A NAME="IDX151"></A>
+Suppose we are parsing a language which has if-then and if-then-else
+statements, with a pair of rules like this:
+<PRE>
+if_stmt:
+          IF expr THEN stmt
+        | IF expr THEN stmt ELSE stmt
+        ;
+</PRE>
+<P>
+Here we assume that <CODE>IF</CODE>, <CODE>THEN</CODE> and <CODE>ELSE</CODE> are
+terminal symbols for specific keyword tokens.
+When the <CODE>ELSE</CODE> token is read and becomes the look-ahead token, the
+contents of the stack (assuming the input is valid) are just right for
+reduction by the first rule.  But it is also legitimate to shift the
+<CODE>ELSE</CODE>, because that would lead to eventual reduction by the second
+rule.
+This situation, where either a shift or a reduction would be valid, is
+called a <EM>shift/reduce conflict</EM>.  Bison is designed to resolve
+these conflicts by choosing to shift, unless otherwise directed by
+operator precedence declarations.  To see the reason for this, let's
+contrast it with the other alternative.
+Since the parser prefers to shift the <CODE>ELSE</CODE>, the result is to attach
+the else-clause to the innermost if-statement, making these two inputs
+equivalent:
+<PRE>
+if x then if y then win (); else lose;
+if x then do; if y then win (); else lose; end;
+</PRE>
+<P>
+But if the parser chose to reduce when possible rather than shift, the
+result would be to attach the else-clause to the outermost if-statement,
+making these two inputs equivalent:
+<PRE>
+if x then if y then win (); else lose;
+if x then do; if y then win (); end; else lose;
+</PRE>
+<P>
+The conflict exists because the grammar as written is ambiguous: either
+parsing of the simple nested if-statement is legitimate.  The established
+convention is that these ambiguities are resolved by attaching the
+else-clause to the innermost if-statement; this is what Bison accomplishes
+by choosing to shift rather than reduce.  (It would ideally be cleaner to
+write an unambiguous grammar, but that is very hard to do in this case.)
+This particular ambiguity was first encountered in the specifications of
+Algol 60 and is called the "dangling <CODE>else</CODE>" ambiguity.
+To avoid warnings from Bison about predictable, legitimate shift/reduce
+conflicts, use the <CODE>%expect <VAR>n</VAR></CODE> declaration.  There will be no
+warning as long as the number of shift/reduce conflicts is exactly <VAR>n</VAR>.
+See section <A HREF="bison.html#SEC54">Suppressing Conflict Warnings</A>.
+The definition of <CODE>if_stmt</CODE> above is solely to blame for the
+conflict, but the conflict does not actually appear without additional
+rules.  Here is a complete Bison input file that actually manifests the
+conflict:
+<PRE>
+%token IF THEN ELSE variable
+%%
+stmt:     expr
+        | if_stmt
+        ;
+if_stmt:
+          IF expr THEN stmt
+        | IF expr THEN stmt ELSE stmt
+        ;
+expr:     variable
+        ;
+</PRE>
+<P>
+<H2><A NAME="SEC71" HREF="bison.html#TOC71">Operator Precedence</A></H2>
+<P>
+<A NAME="IDX152"></A>
+<A NAME="IDX153"></A>
+Another situation where shift/reduce conflicts appear is in arithmetic
+expressions.  Here shifting is not always the preferred resolution; the
+Bison declarations for operator precedence allow you to specify when to
+shift and when to reduce.
+<H3><A NAME="SEC72" HREF="bison.html#TOC72">When Precedence is Needed</A></H3>
+<P>
+Consider the following ambiguous grammar fragment (ambiguous because the
+input <SAMP>`1 - 2 * 3'</SAMP> can be parsed in two different ways):
+<PRE>
+expr:     expr '-' expr
+        | expr '*' expr
+        | expr '&#60;' expr
+        | '(' expr ')'
+        ...
+        ;
+</PRE>
+<P>
+Suppose the parser has seen the tokens <SAMP>`1'</SAMP>, <SAMP>`-'</SAMP> and <SAMP>`2'</SAMP>;
+should it reduce them via the rule for the addition operator?  It depends
+on the next token.  Of course, if the next token is <SAMP>`)'</SAMP>, we must
+reduce; shifting is invalid because no single rule can reduce the token
+sequence <SAMP>`- 2 )'</SAMP> or anything starting with that.  But if the next
+token is <SAMP>`*'</SAMP> or <SAMP>`&#60;'</SAMP>, we have a choice: either shifting or
+reduction would allow the parse to complete, but with different
+results.
+To decide which one Bison should do, we must consider the
+results.  If the next operator token <VAR>op</VAR> is shifted, then it
+must be reduced first in order to permit another opportunity to
+reduce the sum.  The result is (in effect) <SAMP>`1 - (2
+<VAR>op</VAR> 3)'</SAMP>.  On the other hand, if the subtraction is reduced
+before shifting <VAR>op</VAR>, the result is <SAMP>`(1 - 2) <VAR>op</VAR>
+3'</SAMP>.  Clearly, then, the choice of shift or reduce should depend
+on the relative precedence of the operators <SAMP>`-'</SAMP> and
+<VAR>op</VAR>: <SAMP>`*'</SAMP> should be shifted first, but not <SAMP>`&#60;'</SAMP>.
+<A NAME="IDX154"></A>
+What about input such as <SAMP>`1 - 2 - 5'</SAMP>; should this be
+<SAMP>`(1 - 2) - 5'</SAMP> or should it be <SAMP>`1 - (2 - 5)'</SAMP>?  For
+most operators we prefer the former, which is called <EM>left
+association</EM>.  The latter alternative, <EM>right association</EM>, is
+desirable for assignment operators.  The choice of left or right
+association is a matter of whether the parser chooses to shift or
+reduce when the stack contains <SAMP>`1 - 2'</SAMP> and the look-ahead
+token is <SAMP>`-'</SAMP>: shifting makes right-associativity.
+<H3><A NAME="SEC73" HREF="bison.html#TOC73">Specifying Operator Precedence</A></H3>
+<P>
+<A NAME="IDX155"></A>
+<A NAME="IDX156"></A>
+<A NAME="IDX157"></A>
+Bison allows you to specify these choices with the operator precedence
+declarations <CODE>%left</CODE> and <CODE>%right</CODE>.  Each such declaration
+contains a list of tokens, which are operators whose precedence and
+associativity is being declared.  The <CODE>%left</CODE> declaration makes all
+those operators left-associative and the <CODE>%right</CODE> declaration makes
+them right-associative.  A third alternative is <CODE>%nonassoc</CODE>, which
+declares that it is a syntax error to find the same operator twice "in a
+row".
+The relative precedence of different operators is controlled by the
+order in which they are declared.  The first <CODE>%left</CODE> or
+<CODE>%right</CODE> declaration in the file declares the operators whose
+precedence is lowest, the next such declaration declares the operators
+whose precedence is a little higher, and so on.
+<H3><A NAME="SEC74" HREF="bison.html#TOC74">Precedence Examples</A></H3>
+<P>
+In our example, we would want the following declarations:
+<PRE>
+%left '&#60;'
+%left '-'
+%left '*'
+</PRE>
+<P>
+In a more complete example, which supports other operators as well, we
+would declare them in groups of equal precedence.  For example, <CODE>'+'</CODE> is
+declared with <CODE>'-'</CODE>:
+<PRE>
+%left '&#60;' '&#62;' '=' NE LE GE
+%left '+' '-'
+%left '*' '/'
+</PRE>
+<P>
+(Here <CODE>NE</CODE> and so on stand for the operators for "not equal"
+and so on.  We assume that these tokens are more than one character long
+and therefore are represented by names, not character literals.)
+<H3><A NAME="SEC75" HREF="bison.html#TOC75">How Precedence Works</A></H3>
+<P>
+The first effect of the precedence declarations is to assign precedence
+levels to the terminal symbols declared.  The second effect is to assign
+precedence levels to certain rules: each rule gets its precedence from the
+last terminal symbol mentioned in the components.  (You can also specify
+explicitly the precedence of a rule.  See section <A HREF="bison.html#SEC76">Context-Dependent Precedence</A>.)
+Finally, the resolution of conflicts works by comparing the
+precedence of the rule being considered with that of the
+look-ahead token.  If the token's precedence is higher, the
+choice is to shift.  If the rule's precedence is higher, the
+choice is to reduce.  If they have equal precedence, the choice
+is made based on the associativity of that precedence level.  The
+verbose output file made by <SAMP>`-v'</SAMP> (see section <A HREF="bison.html#SEC87">Invoking Bison</A>) says
+how each conflict was resolved.
+Not all rules and not all tokens have precedence.  If either the rule or
+the look-ahead token has no precedence, then the default is to shift.
+<H2><A NAME="SEC76" HREF="bison.html#TOC76">Context-Dependent Precedence</A></H2>
+<P>
+<A NAME="IDX158"></A>
+<A NAME="IDX159"></A>
+<A NAME="IDX160"></A>
+<A NAME="IDX161"></A>
+<A NAME="IDX162"></A>
+Often the precedence of an operator depends on the context.  This sounds
+outlandish at first, but it is really very common.  For example, a minus
+sign typically has a very high precedence as a unary operator, and a
+somewhat lower precedence (lower than multiplication) as a binary operator.
+The Bison precedence declarations, <CODE>%left</CODE>, <CODE>%right</CODE> and
+<CODE>%nonassoc</CODE>, can only be used once for a given token; so a token has
+only one precedence declared in this way.  For context-dependent
+precedence, you need to use an additional mechanism: the <CODE>%prec</CODE>
+modifier for rules.
+The <CODE>%prec</CODE> modifier declares the precedence of a particular rule by
+specifying a terminal symbol whose precedence should be used for that rule.
+It's not necessary for that symbol to appear otherwise in the rule.  The
+modifier's syntax is:
+<PRE>
+%prec <VAR>terminal-symbol</VAR>
+</PRE>
+<P>
+and it is written after the components of the rule.  Its effect is to
+assign the rule the precedence of <VAR>terminal-symbol</VAR>, overriding
+the precedence that would be deduced for it in the ordinary way.  The
+altered rule precedence then affects how conflicts involving that rule
+are resolved (see section <A HREF="bison.html#SEC71">Operator Precedence</A>).
+Here is how <CODE>%prec</CODE> solves the problem of unary minus.  First, declare
+a precedence for a fictitious terminal symbol named <CODE>UMINUS</CODE>.  There
+are no tokens of this type, but the symbol serves to stand for its
+precedence:
+<PRE>
+...
+%left '+' '-'
+%left '*'
+%left UMINUS
+</PRE>
+<P>
+Now the precedence of <CODE>UMINUS</CODE> can be used in specific rules:
+<PRE>
+exp:    ...
+        | exp '-' exp
+        ...
+        | '-' exp %prec UMINUS
+</PRE>
+<P>
+<H2><A NAME="SEC77" HREF="bison.html#TOC77">Parser States</A></H2>
+<P>
+<A NAME="IDX163"></A>
+<A NAME="IDX164"></A>
+<A NAME="IDX165"></A>
+The function <CODE>yyparse</CODE> is implemented using a finite-state machine.
+The values pushed on the parser stack are not simply token type codes; they
+represent the entire sequence of terminal and nonterminal symbols at or
+near the top of the stack.  The current state collects all the information
+about previous input which is relevant to deciding what to do next.
+Each time a look-ahead token is read, the current parser state together
+with the type of look-ahead token are looked up in a table.  This table
+entry can say, "Shift the look-ahead token."  In this case, it also
+specifies the new parser state, which is pushed onto the top of the
+parser stack.  Or it can say, "Reduce using rule number <VAR>n</VAR>."
+This means that a certain number of tokens or groupings are taken off
+the top of the stack, and replaced by one grouping.  In other words,
+that number of states are popped from the stack, and one new state is
+pushed.
+There is one other alternative: the table can say that the look-ahead token
+is erroneous in the current state.  This causes error processing to begin
+(see section <A HREF="bison.html#SEC81">Error Recovery</A>).
+<H2><A NAME="SEC78" HREF="bison.html#TOC78">Reduce/Reduce Conflicts</A></H2>
+<P>
+<A NAME="IDX166"></A>
+<A NAME="IDX167"></A>
+A reduce/reduce conflict occurs if there are two or more rules that apply
+to the same sequence of input.  This usually indicates a serious error
+in the grammar.
+For example, here is an erroneous attempt to define a sequence
+of zero or more <CODE>word</CODE> groupings.
+<PRE>
+sequence: /* empty */
+                { printf ("empty sequence\n"); }
+        | maybeword
+        | sequence word
+                { printf ("added word %s\n", $2); }
+        ;
+maybeword: /* empty */
+                { printf ("empty maybeword\n"); }
+        | word
+                { printf ("single word %s\n", $1); }
+        ;
+</PRE>
+<P>
+The error is an ambiguity: there is more than one way to parse a single
+<CODE>word</CODE> into a <CODE>sequence</CODE>.  It could be reduced to a
+<CODE>maybeword</CODE> and then into a <CODE>sequence</CODE> via the second rule.
+Alternatively, nothing-at-all could be reduced into a <CODE>sequence</CODE>
+via the first rule, and this could be combined with the <CODE>word</CODE>
+using the third rule for <CODE>sequence</CODE>.
+There is also more than one way to reduce nothing-at-all into a
+<CODE>sequence</CODE>.  This can be done directly via the first rule,
+or indirectly via <CODE>maybeword</CODE> and then the second rule.
+You might think that this is a distinction without a difference, because it
+does not change whether any particular input is valid or not.  But it does
+affect which actions are run.  One parsing order runs the second rule's
+action; the other runs the first rule's action and the third rule's action.
+In this example, the output of the program changes.
+Bison resolves a reduce/reduce conflict by choosing to use the rule that
+appears first in the grammar, but it is very risky to rely on this.  Every
+reduce/reduce conflict must be studied and usually eliminated.  Here is the
+proper way to define <CODE>sequence</CODE>:
+<PRE>
+sequence: /* empty */
+                { printf ("empty sequence\n"); }
+        | sequence word
+                { printf ("added word %s\n", $2); }
+        ;
+</PRE>
+<P>
+Here is another common error that yields a reduce/reduce conflict:
+<PRE>
+sequence: /* empty */
+        | sequence words
+        | sequence redirects
+        ;
+words:    /* empty */
+        | words word
+        ;
+redirects:/* empty */
+        | redirects redirect
+        ;
+</PRE>
+<P>
+The intention here is to define a sequence which can contain either
+<CODE>word</CODE> or <CODE>redirect</CODE> groupings.  The individual definitions of
+<CODE>sequence</CODE>, <CODE>words</CODE> and <CODE>redirects</CODE> are error-free, but the
+three together make a subtle ambiguity: even an empty input can be parsed
+in infinitely many ways!
+Consider: nothing-at-all could be a <CODE>words</CODE>.  Or it could be two
+<CODE>words</CODE> in a row, or three, or any number.  It could equally well be a
+<CODE>redirects</CODE>, or two, or any number.  Or it could be a <CODE>words</CODE>
+followed by three <CODE>redirects</CODE> and another <CODE>words</CODE>.  And so on.
+Here are two ways to correct these rules.  First, to make it a single level
+of sequence:
+<PRE>
+sequence: /* empty */
+        | sequence word
+        | sequence redirect
+        ;
+</PRE>
+<P>
+Second, to prevent either a <CODE>words</CODE> or a <CODE>redirects</CODE>
+from being empty:
+<PRE>
+sequence: /* empty */
+        | sequence words
+        | sequence redirects
+        ;
+words:    word
+        | words word
+        ;
+redirects:redirect
+        | redirects redirect
+        ;
+</PRE>
+<P>
+<H2><A NAME="SEC79" HREF="bison.html#TOC79">Mysterious Reduce/Reduce Conflicts</A></H2>
+<P>
+Sometimes reduce/reduce conflicts can occur that don't look warranted.
+Here is an example:
+<PRE>
+%token ID
+%%
+def:    param_spec return_spec ','
+        ;
+param_spec:
+             type
+        |    name_list ':' type
+        ;
+return_spec:
+             type
+        |    name ':' type
+        ;
+type:        ID
+        ;
+name:        ID
+        ;
+name_list:
+             name
+        |    name ',' name_list
+        ;
+</PRE>
+<P>
+It would seem that this grammar can be parsed with only a single token
+of look-ahead: when a <CODE>param_spec</CODE> is being read, an <CODE>ID</CODE> is 
+a <CODE>name</CODE> if a comma or colon follows, or a <CODE>type</CODE> if another
+<CODE>ID</CODE> follows.  In other words, this grammar is LR(1).
+<A NAME="IDX168"></A>
+<A NAME="IDX169"></A>
+However, Bison, like most parser generators, cannot actually handle all
+LR(1) grammars.  In this grammar, two contexts, that after an <CODE>ID</CODE>
+at the beginning of a <CODE>param_spec</CODE> and likewise at the beginning of
+a <CODE>return_spec</CODE>, are similar enough that Bison assumes they are the
+same.  They appear similar because the same set of rules would be
+active--the rule for reducing to a <CODE>name</CODE> and that for reducing to
+a <CODE>type</CODE>.  Bison is unable to determine at that stage of processing
+that the rules would require different look-ahead tokens in the two
+contexts, so it makes a single parser state for them both.  Combining
+the two contexts causes a conflict later.  In parser terminology, this
+occurrence means that the grammar is not LALR(1).
+In general, it is better to fix deficiencies than to document them.  But
+this particular deficiency is intrinsically hard to fix; parser
+generators that can handle LR(1) grammars are hard to write and tend to
+produce parsers that are very large.  In practice, Bison is more useful
+as it is now.
+When the problem arises, you can often fix it by identifying the two
+parser states that are being confused, and adding something to make them
+look distinct.  In the above example, adding one rule to
+<CODE>return_spec</CODE> as follows makes the problem go away:
+<PRE>
+%token BOGUS
+...
+%%
+...
+return_spec:
+             type
+        |    name ':' type
+        /* This rule is never used.  */
+        |    ID BOGUS
+        ;
+</PRE>
+<P>
+This corrects the problem because it introduces the possibility of an
+additional active rule in the context after the <CODE>ID</CODE> at the beginning of
+<CODE>return_spec</CODE>.  This rule is not active in the corresponding context
+in a <CODE>param_spec</CODE>, so the two contexts receive distinct parser states.
+As long as the token <CODE>BOGUS</CODE> is never generated by <CODE>yylex</CODE>,
+the added rule cannot alter the way actual input is parsed.
+In this particular example, there is another way to solve the problem:
+rewrite the rule for <CODE>return_spec</CODE> to use <CODE>ID</CODE> directly
+instead of via <CODE>name</CODE>.  This also causes the two confusing
+contexts to have different sets of active rules, because the one for
+<CODE>return_spec</CODE> activates the altered rule for <CODE>return_spec</CODE>
+rather than the one for <CODE>name</CODE>.
+<PRE>
+param_spec:
+             type
+        |    name_list ':' type
+        ;
+return_spec:
+             type
+        |    ID ':' type
+        ;
+</PRE>
+<P>
+<H2><A NAME="SEC80" HREF="bison.html#TOC80">Stack Overflow, and How to Avoid It</A></H2>
+<P>
+<A NAME="IDX170"></A>
+<A NAME="IDX171"></A>
+<A NAME="IDX172"></A>
+The Bison parser stack can overflow if too many tokens are shifted and
+not reduced.  When this happens, the parser function <CODE>yyparse</CODE>
+returns a nonzero value, pausing only to call <CODE>yyerror</CODE> to report
+the overflow.
+<A NAME="IDX173"></A>
+By defining the macro <CODE>YYMAXDEPTH</CODE>, you can control how deep the
+parser stack can become before a stack overflow occurs.  Define the
+macro with a value that is an integer.  This value is the maximum number
+of tokens that can be shifted (and not reduced) before overflow.
+It must be a constant expression whose value is known at compile time.
+The stack space allowed is not necessarily allocated.  If you specify a
+large value for <CODE>YYMAXDEPTH</CODE>, the parser actually allocates a small
+stack at first, and then makes it bigger by stages as needed.  This
+increasing allocation happens automatically and silently.  Therefore,
+you do not need to make <CODE>YYMAXDEPTH</CODE> painfully small merely to save
+space for ordinary inputs that do not need much stack.
+<A NAME="IDX174"></A>
+The default value of <CODE>YYMAXDEPTH</CODE>, if you do not define it, is
+10000.
+<A NAME="IDX175"></A>
+You can control how much stack is allocated initially by defining the
+macro <CODE>YYINITDEPTH</CODE>.  This value too must be a compile-time
+constant integer.  The default is 200.
+<H1><A NAME="SEC81" HREF="bison.html#TOC81">Error Recovery</A></H1>
+<P>
+<A NAME="IDX176"></A>
+<A NAME="IDX177"></A>
+It is not usually acceptable to have a program terminate on a parse
+error.  For example, a compiler should recover sufficiently to parse the
+rest of the input file and check it for errors; a calculator should accept
+another expression.
+In a simple interactive command parser where each input is one line, it may
+be sufficient to allow <CODE>yyparse</CODE> to return 1 on error and have the
+caller ignore the rest of the input line when that happens (and then call
+<CODE>yyparse</CODE> again).  But this is inadequate for a compiler, because it
+forgets all the syntactic context leading up to the error.  A syntax error
+deep within a function in the compiler input should not cause the compiler
+to treat the following line like the beginning of a source file.
+<A NAME="IDX178"></A>
+You can define how to recover from a syntax error by writing rules to
+recognize the special token <CODE>error</CODE>.  This is a terminal symbol that
+is always defined (you need not declare it) and reserved for error
+handling.  The Bison parser generates an <CODE>error</CODE> token whenever a
+syntax error happens; if you have provided a rule to recognize this token
+in the current context, the parse can continue.  
+For example:
+<PRE>
+stmnts:  /* empty string */
+        | stmnts '\n'
+        | stmnts exp '\n'
+        | stmnts error '\n'
+</PRE>
+<P>
+The fourth rule in this example says that an error followed by a newline
+makes a valid addition to any <CODE>stmnts</CODE>.
+What happens if a syntax error occurs in the middle of an <CODE>exp</CODE>?  The
+error recovery rule, interpreted strictly, applies to the precise sequence
+of a <CODE>stmnts</CODE>, an <CODE>error</CODE> and a newline.  If an error occurs in
+the middle of an <CODE>exp</CODE>, there will probably be some additional tokens
+and subexpressions on the stack after the last <CODE>stmnts</CODE>, and there
+will be tokens to read before the next newline.  So the rule is not
+applicable in the ordinary way.
+But Bison can force the situation to fit the rule, by discarding part of
+the semantic context and part of the input.  First it discards states and
+objects from the stack until it gets back to a state in which the
+<CODE>error</CODE> token is acceptable.  (This means that the subexpressions
+already parsed are discarded, back to the last complete <CODE>stmnts</CODE>.)  At
+this point the <CODE>error</CODE> token can be shifted.  Then, if the old
+look-ahead token is not acceptable to be shifted next, the parser reads
+tokens and discards them until it finds a token which is acceptable.  In
+this example, Bison reads and discards input until the next newline
+so that the fourth rule can apply.
+The choice of error rules in the grammar is a choice of strategies for
+error recovery.  A simple and useful strategy is simply to skip the rest of
+the current input line or current statement if an error is detected:
+<PRE>
+stmnt: error ';'  /* on error, skip until ';' is read */
+</PRE>
+<P>
+It is also useful to recover to the matching close-delimiter of an
+opening-delimiter that has already been parsed.  Otherwise the
+close-delimiter will probably appear to be unmatched, and generate another,
+spurious error message:
+<PRE>
+primary:  '(' expr ')'
+        | '(' error ')'
+        ...
+        ;
+</PRE>
+<P>
+Error recovery strategies are necessarily guesses.  When they guess wrong,
+one syntax error often leads to another.  In the above example, the error
+recovery rule guesses that an error is due to bad input within one
+<CODE>stmnt</CODE>.  Suppose that instead a spurious semicolon is inserted in the
+middle of a valid <CODE>stmnt</CODE>.  After the error recovery rule recovers
+from the first error, another syntax error will be found straightaway,
+since the text following the spurious semicolon is also an invalid
+<CODE>stmnt</CODE>.
+To prevent an outpouring of error messages, the parser will output no error
+message for another syntax error that happens shortly after the first; only
+after three consecutive input tokens have been successfully shifted will
+error messages resume.
+Note that rules which accept the <CODE>error</CODE> token may have actions, just
+as any other rules can.
+<A NAME="IDX179"></A>
+You can make error messages resume immediately by using the macro
+<CODE>yyerrok</CODE> in an action.  If you do this in the error rule's action, no
+error messages will be suppressed.  This macro requires no arguments;
+<SAMP>`yyerrok;'</SAMP> is a valid C statement.
+<A NAME="IDX180"></A>
+The previous look-ahead token is reanalyzed immediately after an error.  If
+this is unacceptable, then the macro <CODE>yyclearin</CODE> may be used to clear
+this token.  Write the statement <SAMP>`yyclearin;'</SAMP> in the error rule's
+action.
+For example, suppose that on a parse error, an error handling routine is
+called that advances the input stream to some point where parsing should
+once again commence.  The next symbol returned by the lexical scanner is
+probably correct.  The previous look-ahead token ought to be discarded
+with <SAMP>`yyclearin;'</SAMP>.
+<A NAME="IDX181"></A>
+The macro <CODE>YYRECOVERING</CODE> stands for an expression that has the
+value 1 when the parser is recovering from a syntax error, and 0 the
+rest of the time.  A value of 1 indicates that error messages are
+currently suppressed for new syntax errors.
+<H1><A NAME="SEC82" HREF="bison.html#TOC82">Handling Context Dependencies</A></H1>
+<P>
+The Bison paradigm is to parse tokens first, then group them into larger
+syntactic units.  In many languages, the meaning of a token is affected by
+its context.  Although this violates the Bison paradigm, certain techniques
+(known as <EM>kludges</EM>) may enable you to write Bison parsers for such
+languages.
+(Actually, "kludge" means any technique that gets its job done but is
+neither clean nor robust.)
+<H2><A NAME="SEC83" HREF="bison.html#TOC83">Semantic Info in Token Types</A></H2>
+<P>
+The C language has a context dependency: the way an identifier is used
+depends on what its current meaning is.  For example, consider this:
+<PRE>
+foo (x);
+</PRE>
+<P>
+This looks like a function call statement, but if <CODE>foo</CODE> is a typedef
+name, then this is actually a declaration of <CODE>x</CODE>.  How can a Bison
+parser for C decide how to parse this input?
+The method used in GNU C is to have two different token types,
+<CODE>IDENTIFIER</CODE> and <CODE>TYPENAME</CODE>.  When <CODE>yylex</CODE> finds an
+identifier, it looks up the current declaration of the identifier in order
+to decide which token type to return: <CODE>TYPENAME</CODE> if the identifier is
+declared as a typedef, <CODE>IDENTIFIER</CODE> otherwise.
+The grammar rules can then express the context dependency by the choice of
+token type to recognize.  <CODE>IDENTIFIER</CODE> is accepted as an expression,
+but <CODE>TYPENAME</CODE> is not.  <CODE>TYPENAME</CODE> can start a declaration, but
+<CODE>IDENTIFIER</CODE> cannot.  In contexts where the meaning of the identifier
+is <EM>not</EM> significant, such as in declarations that can shadow a
+typedef name, either <CODE>TYPENAME</CODE> or <CODE>IDENTIFIER</CODE> is
+accepted--there is one rule for each of the two token types.
+This technique is simple to use if the decision of which kinds of
+identifiers to allow is made at a place close to where the identifier is
+parsed.  But in C this is not always so: C allows a declaration to
+redeclare a typedef name provided an explicit type has been specified
+earlier:
+<PRE>
+typedef int foo, bar, lose;
+static foo (bar);        /* redeclare <CODE>bar</CODE> as static variable */
+static int foo (lose);   /* redeclare <CODE>foo</CODE> as function */
+</PRE>
+<P>
+Unfortunately, the name being declared is separated from the declaration
+construct itself by a complicated syntactic structure--the "declarator".
+As a result, the part of Bison parser for C needs to be duplicated, with
+all the nonterminal names changed: once for parsing a declaration in which
+a typedef name can be redefined, and once for parsing a declaration in
+which that can't be done.  Here is a part of the duplication, with actions
+omitted for brevity:
+<PRE>
+initdcl:
+          declarator maybeasm '='
+          init
+        | declarator maybeasm
+        ;
+notype_initdcl:
+          notype_declarator maybeasm '='
+          init
+        | notype_declarator maybeasm
+        ;
+</PRE>
+<P>
+Here <CODE>initdcl</CODE> can redeclare a typedef name, but <CODE>notype_initdcl</CODE>
+cannot.  The distinction between <CODE>declarator</CODE> and
+<CODE>notype_declarator</CODE> is the same sort of thing.
+There is some similarity between this technique and a lexical tie-in
+(described next), in that information which alters the lexical analysis is
+changed during parsing by other parts of the program.  The difference is
+here the information is global, and is used for other purposes in the
+program.  A true lexical tie-in has a special-purpose flag controlled by
+the syntactic context.
+<H2><A NAME="SEC84" HREF="bison.html#TOC84">Lexical Tie-ins</A></H2>
+<P>
+<A NAME="IDX182"></A>
+One way to handle context-dependency is the <EM>lexical tie-in</EM>: a flag
+which is set by Bison actions, whose purpose is to alter the way tokens are
+parsed.
+For example, suppose we have a language vaguely like C, but with a special
+construct <SAMP>`hex (<VAR>hex-expr</VAR>)'</SAMP>.  After the keyword <CODE>hex</CODE> comes
+an expression in parentheses in which all integers are hexadecimal.  In
+particular, the token <SAMP>`a1b'</SAMP> must be treated as an integer rather than
+as an identifier if it appears in that context.  Here is how you can do it:
+<PRE>
+%{
+int hexflag;
+%}
+%%
+...
+expr:   IDENTIFIER
+        | constant
+        | HEX '('
+                { hexflag = 1; }
+          expr ')'
+                { hexflag = 0;
+                   $$ = $4; }
+        | expr '+' expr
+                { $$ = make_sum ($1, $3); }
+        ...
+        ;
+constant:
+          INTEGER
+        | STRING
+        ;
+</PRE>
+<P>
+Here we assume that <CODE>yylex</CODE> looks at the value of <CODE>hexflag</CODE>; when
+it is nonzero, all integers are parsed in hexadecimal, and tokens starting
+with letters are parsed as integers if possible.
+The declaration of <CODE>hexflag</CODE> shown in the C declarations section of
+the parser file is needed to make it accessible to the actions 
+(see section <A HREF="bison.html#SEC36">The C Declarations Section</A>).  You must also write the code in <CODE>yylex</CODE>
+to obey the flag.
+<H2><A NAME="SEC85" HREF="bison.html#TOC85">Lexical Tie-ins and Error Recovery</A></H2>
+<P>
+Lexical tie-ins make strict demands on any error recovery rules you have.
+See section <A HREF="bison.html#SEC81">Error Recovery</A>.
+The reason for this is that the purpose of an error recovery rule is to
+abort the parsing of one construct and resume in some larger construct.
+For example, in C-like languages, a typical error recovery rule is to skip
+tokens until the next semicolon, and then start a new statement, like this:
+<PRE>
+stmt:   expr ';'
+        | IF '(' expr ')' stmt { ... }
+        ...
+        error ';'
+                { hexflag = 0; }
+        ;
+</PRE>
+<P>
+If there is a syntax error in the middle of a <SAMP>`hex (<VAR>expr</VAR>)'</SAMP>
+construct, this error rule will apply, and then the action for the
+completed <SAMP>`hex (<VAR>expr</VAR>)'</SAMP> will never run.  So <CODE>hexflag</CODE> would
+remain set for the entire rest of the input, or until the next <CODE>hex</CODE>
+keyword, causing identifiers to be misinterpreted as integers.
+To avoid this problem the error recovery rule itself clears <CODE>hexflag</CODE>.
+There may also be an error recovery rule that works within expressions.
+For example, there could be a rule which applies within parentheses
+and skips to the close-parenthesis:
+<PRE>
+expr:   ...
+        | '(' expr ')'
+                { $$ = $2; }
+        | '(' error ')'
+        ...
+</PRE>
+<P>
+If this rule acts within the <CODE>hex</CODE> construct, it is not going to abort
+that construct (since it applies to an inner level of parentheses within
+the construct).  Therefore, it should not clear the flag: the rest of
+the <CODE>hex</CODE> construct should be parsed with the flag still in effect.
+What if there is an error recovery rule which might abort out of the
+<CODE>hex</CODE> construct or might not, depending on circumstances?  There is no
+way you can write the action to determine whether a <CODE>hex</CODE> construct is
+being aborted or not.  So if you are using a lexical tie-in, you had better
+make sure your error recovery rules are not of this kind.  Each rule must
+be such that you can be sure that it always will, or always won't, have to
+clear the flag.
+<H1><A NAME="SEC86" HREF="bison.html#TOC86">Debugging Your Parser</A></H1>
+<P>
+<A NAME="IDX183"></A>
+<A NAME="IDX184"></A>
+<A NAME="IDX185"></A>
+<A NAME="IDX186"></A>
+If a Bison grammar compiles properly but doesn't do what you want when it
+runs, the <CODE>yydebug</CODE> parser-trace feature can help you figure out why.
+To enable compilation of trace facilities, you must define the macro
+<CODE>YYDEBUG</CODE> when you compile the parser.  You could use
+<SAMP>`-DYYDEBUG=1'</SAMP> as a compiler option or you could put <SAMP>`#define
+YYDEBUG 1'</SAMP> in the C declarations section of the grammar file 
+(see section <A HREF="bison.html#SEC36">The C Declarations Section</A>).  Alternatively, use the <SAMP>`-t'</SAMP> option when
+you run Bison (see section <A HREF="bison.html#SEC87">Invoking Bison</A>).  We always define <CODE>YYDEBUG</CODE> so that
+debugging is always possible.
+The trace facility uses <CODE>stderr</CODE>, so you must add <CODE>#include
+&#60;stdio.h&#62;</CODE> to the C declarations section unless it is already there.
+Once you have compiled the program with trace facilities, the way to
+request a trace is to store a nonzero value in the variable <CODE>yydebug</CODE>.
+You can do this by making the C code do it (in <CODE>main</CODE>, perhaps), or
+you can alter the value with a C debugger.
+Each step taken by the parser when <CODE>yydebug</CODE> is nonzero produces a
+line or two of trace information, written on <CODE>stderr</CODE>.  The trace
+messages tell you these things:
+<UL>
+<LI>
+Each time the parser calls <CODE>yylex</CODE>, what kind of token was read.
+<LI>
+Each time a token is shifted, the depth and complete contents of the
+state stack (see section <A HREF="bison.html#SEC77">Parser States</A>).
+<LI>
+Each time a rule is reduced, which rule it is, and the complete contents
+of the state stack afterward.
+</UL>
+<P>
+To make sense of this information, it helps to refer to the listing file
+produced by the Bison <SAMP>`-v'</SAMP> option (see section <A HREF="bison.html#SEC87">Invoking Bison</A>).  This file
+shows the meaning of each state in terms of positions in various rules, and
+also what each state will do with each possible input token.  As you read
+the successive trace messages, you can see that the parser is functioning
+according to its specification in the listing file.  Eventually you will
+arrive at the place where something undesirable happens, and you will see
+which parts of the grammar are to blame.
+The parser file is a C program and you can use C debuggers on it, but it's
+not easy to interpret what it is doing.  The parser function is a
+finite-state machine interpreter, and aside from the actions it executes
+the same code over and over.  Only the values of variables show where in
+the grammar it is working.
+<A NAME="IDX187"></A>
+The debugging information normally gives the token type of each token
+read, but not its semantic value.  You can optionally define a macro
+named <CODE>YYPRINT</CODE> to provide a way to print the value.  If you define
+<CODE>YYPRINT</CODE>, it should take three arguments.  The parser will pass a
+standard I/O stream, the numeric code for the token type, and the token
+value (from <CODE>yylval</CODE>).
+Here is an example of <CODE>YYPRINT</CODE> suitable for the multi-function
+calculator (see section <A HREF="bison.html#SEC30">Declarations for <CODE>mfcalc</CODE></A>):
+<PRE>
+#define YYPRINT(file, type, value)   yyprint (file, type, value)
+static void
+yyprint (file, type, value)
+     FILE *file;
+     int type;
+     YYSTYPE value;
+{
+  if (type == VAR)
+    fprintf (file, " %s", value.tptr-&#62;name);
+  else if (type == NUM)
+    fprintf (file, " %d", value.val);
+}
+</PRE>
+<P>
+<H1><A NAME="SEC87" HREF="bison.html#TOC87">Invoking Bison</A></H1>
+<P>
+<A NAME="IDX188"></A>
+<A NAME="IDX189"></A>
+<A NAME="IDX190"></A>
+The usual way to invoke Bison is as follows:
+<PRE>
+bison <VAR>infile</VAR>
+</PRE>
+<P>
+Here <VAR>infile</VAR> is the grammar file name, which usually ends in
+<SAMP>`.y'</SAMP>.  The parser file's name is made by replacing the <SAMP>`.y'</SAMP>
+with <SAMP>`.tab.c'</SAMP>.  Thus, the <SAMP>`bison foo.y'</SAMP> filename yields
+<TT>`foo.tab.c'</TT>, and the <SAMP>`bison hack/foo.y'</SAMP> filename yields
+<TT>`hack/foo.tab.c'</TT>.
+<H2><A NAME="SEC88" HREF="bison.html#TOC88">Bison Options</A></H2>
+<P>
+Bison supports both traditional single-letter options and mnemonic long
+option names.  Long option names are indicated with <SAMP>`--'</SAMP> instead of
+<SAMP>`-'</SAMP>.  Abbreviations for option names are allowed as long as they
+are unique.  When a long option takes an argument, like
+<SAMP>`--file-prefix'</SAMP>, connect the option name and the argument with
+<SAMP>`='</SAMP>.
+Here is a list of options that can be used with Bison, alphabetized by
+short option.  It is followed by a cross key alphabetized by long
+option.
+<DL COMPACT>
+<DT><SAMP>`-b <VAR>file-prefix</VAR>'</SAMP>
+<DD>
+<DT><SAMP>`--file-prefix=<VAR>prefix</VAR>'</SAMP>
+<DD>
+Specify a prefix to use for all Bison output file names.  The names are
+chosen as if the input file were named <TT>`<VAR>prefix</VAR>.c'</TT>.
+<DT><SAMP>`-d'</SAMP>
+<DD>
+<DT><SAMP>`--defines'</SAMP>
+<DD>
+Write an extra output file containing macro definitions for the token
+type names defined in the grammar and the semantic value type
+<CODE>YYSTYPE</CODE>, as well as a few <CODE>extern</CODE> variable declarations.
+If the parser output file is named <TT>`<VAR>name</VAR>.c'</TT> then this file
+is named <TT>`<VAR>name</VAR>.h'</TT>.
+This output file is essential if you wish to put the definition of
+<CODE>yylex</CODE> in a separate source file, because <CODE>yylex</CODE> needs to
+be able to refer to token type codes and the variable
+<CODE>yylval</CODE>.  See section <A HREF="bison.html#SEC63">Semantic Values of Tokens</A>.
+<DT><SAMP>`-l'</SAMP>
+<DD>
+<DT><SAMP>`--no-lines'</SAMP>
+<DD>
+Don't put any <CODE>#line</CODE> preprocessor commands in the parser file.
+Ordinarily Bison puts them in the parser file so that the C compiler
+and debuggers will associate errors with your source file, the
+grammar file.  This option causes them to associate errors with the
+parser file, treating it an independent source file in its own right.
+<DT><SAMP>`-o <VAR>outfile</VAR>'</SAMP>
+<DD>
+<DT><SAMP>`--output-file=<VAR>outfile</VAR>'</SAMP>
+<DD>
+Specify the name <VAR>outfile</VAR> for the parser file.
+The other output files' names are constructed from <VAR>outfile</VAR>
+as described under the <SAMP>`-v'</SAMP> and <SAMP>`-d'</SAMP> switches.
+<DT><SAMP>`-p <VAR>prefix</VAR>'</SAMP>
+<DD>
+<DT><SAMP>`--name-prefix=<VAR>prefix</VAR>'</SAMP>
+<DD>
+Rename the external symbols used in the parser so that they start with
+<VAR>prefix</VAR> instead of <SAMP>`yy'</SAMP>.  The precise list of symbols renamed
+is <CODE>yyparse</CODE>, <CODE>yylex</CODE>, <CODE>yyerror</CODE>, <CODE>yynerrs</CODE>,
+<CODE>yylval</CODE>, <CODE>yychar</CODE> and <CODE>yydebug</CODE>.
+For example, if you use <SAMP>`-p c'</SAMP>, the names become <CODE>cparse</CODE>,
+<CODE>clex</CODE>, and so on.
+See section <A HREF="bison.html#SEC58">Multiple Parsers in the Same Program</A>.
+<DT><SAMP>`-t'</SAMP>
+<DD>
+<DT><SAMP>`--debug'</SAMP>
+<DD>
+Output a definition of the macro <CODE>YYDEBUG</CODE> into the parser file,
+so that the debugging facilities are compiled.  See section <A HREF="bison.html#SEC86">Debugging Your Parser</A>.
+<DT><SAMP>`-v'</SAMP>
+<DD>
+<DT><SAMP>`--verbose'</SAMP>
+<DD>
+Write an extra output file containing verbose descriptions of the
+parser states and what is done for each type of look-ahead token in
+that state.
+This file also describes all the conflicts, both those resolved by
+operator precedence and the unresolved ones.
+The file's name is made by removing <SAMP>`.tab.c'</SAMP> or <SAMP>`.c'</SAMP> from
+the parser output file name, and adding <SAMP>`.output'</SAMP> instead.
+Therefore, if the input file is <TT>`foo.y'</TT>, then the parser file is
+called <TT>`foo.tab.c'</TT> by default.  As a consequence, the verbose
+output file is called <TT>`foo.output'</TT>.
+<DT><SAMP>`-V'</SAMP>
+<DD>
+<DT><SAMP>`--version'</SAMP>
+<DD>
+Print the version number of Bison and exit.
+<DT><SAMP>`-h'</SAMP>
+<DD>
+<DT><SAMP>`--help'</SAMP>
+<DD>
+Print a summary of the command-line options to Bison and exit.
+<DT><SAMP>`-y'</SAMP>
+<DD>
+<DT><SAMP>`--yacc'</SAMP>
+<DD>
+<DT><SAMP>`--fixed-output-files'</SAMP>
+<DD>
+Equivalent to <SAMP>`-o y.tab.c'</SAMP>; the parser output file is called
+<TT>`y.tab.c'</TT>, and the other outputs are called <TT>`y.output'</TT> and
+<TT>`y.tab.h'</TT>.  The purpose of this switch is to imitate Yacc's output
+file name conventions.  Thus, the following shell script can substitute
+for Yacc:
+<PRE>
+bison -y $*
+</PRE>
+</DL>
+<P>
+<H2><A NAME="SEC89" HREF="bison.html#TOC89">Option Cross Key</A></H2>
+<P>
+Here is a list of options, alphabetized by long option, to help you find
+the corresponding short option.
+<H2><A NAME="SEC90" HREF="bison.html#TOC90">Invoking Bison under VMS</A></H2>
+<P>
+<A NAME="IDX191"></A>
+<A NAME="IDX192"></A>
+The command line syntax for Bison on VMS is a variant of the usual
+Bison command syntax--adapted to fit VMS conventions.
+To find the VMS equivalent for any Bison option, start with the long
+option, and substitute a <SAMP>`/'</SAMP> for the leading <SAMP>`--'</SAMP>, and
+substitute a <SAMP>`_'</SAMP> for each <SAMP>`-'</SAMP> in the name of the long option.
+For example, the following invocation under VMS:
+<PRE>
+bison /debug/name_prefix=bar foo.y
+</PRE>
+<P>
+is equivalent to the following command under POSIX.
+<PRE>
+bison --debug --name-prefix=bar foo.y
+</PRE>
+<P>
+The VMS file system does not permit filenames such as
+<TT>`foo.tab.c'</TT>.  In the above example, the output file
+would instead be named <TT>`foo_tab.c'</TT>.
+<H1><A NAME="SEC91" HREF="bison.html#TOC91">Bison Symbols</A></H1>
+<P>
+<A NAME="IDX193"></A>
+<A NAME="IDX194"></A>
+<DL COMPACT>
+<DT><CODE>error</CODE>
+<DD>
+A token name reserved for error recovery.  This token may be used in
+grammar rules so as to allow the Bison parser to recognize an error in
+the grammar without halting the process.  In effect, a sentence
+containing an error may be recognized as valid.  On a parse error, the
+token <CODE>error</CODE> becomes the current look-ahead token.  Actions
+corresponding to <CODE>error</CODE> are then executed, and the look-ahead
+token is reset to the token that originally caused the violation.
+See section <A HREF="bison.html#SEC81">Error Recovery</A>.
+<DT><CODE>YYABORT</CODE>
+<DD>
+Macro to pretend that an unrecoverable syntax error has occurred, by
+making <CODE>yyparse</CODE> return 1 immediately.  The error reporting
+function <CODE>yyerror</CODE> is not called.  See section <A HREF="bison.html#SEC60">The Parser Function <CODE>yyparse</CODE></A>.
+<DT><CODE>YYACCEPT</CODE>
+<DD>
+Macro to pretend that a complete utterance of the language has been
+read, by making <CODE>yyparse</CODE> return 0 immediately.  
+See section <A HREF="bison.html#SEC60">The Parser Function <CODE>yyparse</CODE></A>.
+<DT><CODE>YYBACKUP</CODE>
+<DD>
+Macro to discard a value from the parser stack and fake a look-ahead
+token.  See section <A HREF="bison.html#SEC67">Special Features for Use in Actions</A>.
+<DT><CODE>YYERROR</CODE>
+<DD>
+Macro to pretend that a syntax error has just been detected: call
+<CODE>yyerror</CODE> and then perform normal error recovery if possible
+(see section <A HREF="bison.html#SEC81">Error Recovery</A>), or (if recovery is impossible) make
+<CODE>yyparse</CODE> return 1.  See section <A HREF="bison.html#SEC81">Error Recovery</A>.
+<DT><CODE>YYERROR_VERBOSE</CODE>
+<DD>
+Macro that you define with <CODE>#define</CODE> in the Bison declarations
+section to request verbose, specific error message strings when
+<CODE>yyerror</CODE> is called.
+<DT><CODE>YYINITDEPTH</CODE>
+<DD>
+Macro for specifying the initial size of the parser stack.
+See section <A HREF="bison.html#SEC80">Stack Overflow, and How to Avoid It</A>.
+<DT><CODE>YYLEX_PARAM</CODE>
+<DD>
+Macro for specifying an extra argument (or list of extra arguments) for
+<CODE>yyparse</CODE> to pass to <CODE>yylex</CODE>.  See section <A HREF="bison.html#SEC65">Calling Conventions for Pure Parsers</A>.
+<DT><CODE>YYLTYPE</CODE>
+<DD>
+Macro for the data type of <CODE>yylloc</CODE>; a structure with four
+members.  See section <A HREF="bison.html#SEC64">Textual Positions of Tokens</A>.
+<DT><CODE>YYMAXDEPTH</CODE>
+<DD>
+Macro for specifying the maximum size of the parser stack.
+See section <A HREF="bison.html#SEC80">Stack Overflow, and How to Avoid It</A>.
+<DT><CODE>YYPARSE_PARAM</CODE>
+<DD>
+Macro for specifying the name of a parameter that <CODE>yyparse</CODE> should
+accept.  See section <A HREF="bison.html#SEC65">Calling Conventions for Pure Parsers</A>.
+<DT><CODE>YYRECOVERING</CODE>
+<DD>
+Macro whose value indicates whether the parser is recovering from a
+syntax error.  See section <A HREF="bison.html#SEC67">Special Features for Use in Actions</A>.
+<DT><CODE>YYSTYPE</CODE>
+<DD>
+Macro for the data type of semantic values; <CODE>int</CODE> by default.
+See section <A HREF="bison.html#SEC44">Data Types of Semantic Values</A>.
+<DT><CODE>yychar</CODE>
+<DD>
+External integer variable that contains the integer value of the
+current look-ahead token.  (In a pure parser, it is a local variable
+within <CODE>yyparse</CODE>.)  Error-recovery rule actions may examine this
+variable.  See section <A HREF="bison.html#SEC67">Special Features for Use in Actions</A>.
+<DT><CODE>yyclearin</CODE>
+<DD>
+Macro used in error-recovery rule actions.  It clears the previous
+look-ahead token.  See section <A HREF="bison.html#SEC81">Error Recovery</A>.
+<DT><CODE>yydebug</CODE>
+<DD>
+External integer variable set to zero by default.  If <CODE>yydebug</CODE>
+is given a nonzero value, the parser will output information on input
+symbols and parser action.  See section <A HREF="bison.html#SEC86">Debugging Your Parser</A>.
+<DT><CODE>yyerrok</CODE>
+<DD>
+Macro to cause parser to recover immediately to its normal mode
+after a parse error.  See section <A HREF="bison.html#SEC81">Error Recovery</A>.
+<DT><CODE>yyerror</CODE>
+<DD>
+User-supplied function to be called by <CODE>yyparse</CODE> on error.  The
+function receives one argument, a pointer to a character string
+containing an error message.  See section <A HREF="bison.html#SEC66">The Error Reporting Function <CODE>yyerror</CODE></A>.
+<DT><CODE>yylex</CODE>
+<DD>
+User-supplied lexical analyzer function, called with no arguments
+to get the next token.  See section <A HREF="bison.html#SEC61">The Lexical Analyzer Function <CODE>yylex</CODE></A>.
+<DT><CODE>yylval</CODE>
+<DD>
+External variable in which <CODE>yylex</CODE> should place the semantic
+value associated with a token.  (In a pure parser, it is a local
+variable within <CODE>yyparse</CODE>, and its address is passed to
+<CODE>yylex</CODE>.)  See section <A HREF="bison.html#SEC63">Semantic Values of Tokens</A>.
+<DT><CODE>yylloc</CODE>
+<DD>
+External variable in which <CODE>yylex</CODE> should place the line and
+column numbers associated with a token.  (In a pure parser, it is a
+local variable within <CODE>yyparse</CODE>, and its address is passed to
+<CODE>yylex</CODE>.)  You can ignore this variable if you don't use the
+<SAMP>`@'</SAMP> feature in the grammar actions.  See section <A HREF="bison.html#SEC64">Textual Positions of Tokens</A>.
+<DT><CODE>yynerrs</CODE>
+<DD>
+Global variable which Bison increments each time there is a parse
+error.  (In a pure parser, it is a local variable within
+<CODE>yyparse</CODE>.)  See section <A HREF="bison.html#SEC66">The Error Reporting Function <CODE>yyerror</CODE></A>.
+<DT><CODE>yyparse</CODE>
+<DD>
+The parser function produced by Bison; call this function to start
+parsing.  See section <A HREF="bison.html#SEC60">The Parser Function <CODE>yyparse</CODE></A>.
+<DT><CODE>%left</CODE>
+<DD>
+Bison declaration to assign left associativity to token(s).
+See section <A HREF="bison.html#SEC51">Operator Precedence</A>.
+<DT><CODE>%nonassoc</CODE>
+<DD>
+Bison declaration to assign nonassociativity to token(s).
+See section <A HREF="bison.html#SEC51">Operator Precedence</A>.
+<DT><CODE>%prec</CODE>
+<DD>
+Bison declaration to assign a precedence to a specific rule.
+See section <A HREF="bison.html#SEC76">Context-Dependent Precedence</A>.
+<DT><CODE>%pure_parser</CODE>
+<DD>
+Bison declaration to request a pure (reentrant) parser.
+See section <A HREF="bison.html#SEC56">A Pure (Reentrant) Parser</A>.
+<DT><CODE>%right</CODE>
+<DD>
+Bison declaration to assign right associativity to token(s).
+See section <A HREF="bison.html#SEC51">Operator Precedence</A>.
+<DT><CODE>%start</CODE>
+<DD>
+Bison declaration to specify the start symbol.  See section <A HREF="bison.html#SEC55">The Start-Symbol</A>.
+<DT><CODE>%token</CODE>
+<DD>
+Bison declaration to declare token(s) without specifying precedence.
+See section <A HREF="bison.html#SEC50">Token Type Names</A>.
+<DT><CODE>%type</CODE>
+<DD>
+Bison declaration to declare nonterminals.  See section <A HREF="bison.html#SEC53">Nonterminal Symbols</A>.
+<DT><CODE>%union</CODE>
+<DD>
+Bison declaration to specify several possible data types for semantic
+values.  See section <A HREF="bison.html#SEC52">The Collection of Value Types</A>.
+</DL>
+<P>
+These are the punctuation and delimiters used in Bison input:
+<DL COMPACT>
+<DT><SAMP>`%%'</SAMP>
+<DD>
+Delimiter used to separate the grammar rule section from the
+Bison declarations section or the additional C code section.
+See section <A HREF="bison.html#SEC14">The Overall Layout of a Bison Grammar</A>.
+<DT><SAMP>`%{ %}'</SAMP>
+<DD>
+All code listed between <SAMP>`%{'</SAMP> and <SAMP>`%}'</SAMP> is copied directly
+to the output file uninterpreted.  Such code forms the "C
+declarations" section of the input file.  See section <A HREF="bison.html#SEC35">Outline of a Bison Grammar</A>.
+<DT><SAMP>`/*...*/'</SAMP>
+<DD>
+Comment delimiters, as in C.
+<DT><SAMP>`:'</SAMP>
+<DD>
+Separates a rule's result from its components.  See section <A HREF="bison.html#SEC41">Syntax of Grammar Rules</A>.
+<DT><SAMP>`;'</SAMP>
+<DD>
+Terminates a rule.  See section <A HREF="bison.html#SEC41">Syntax of Grammar Rules</A>.
+<DT><SAMP>`|'</SAMP>
+<DD>
+Separates alternate rules for the same result nonterminal.
+See section <A HREF="bison.html#SEC41">Syntax of Grammar Rules</A>.
+</DL>
+<P>
+<H1><A NAME="SEC92" HREF="bison.html#TOC92">Glossary</A></H1>
+<P>
+<A NAME="IDX195"></A>
+<DL COMPACT>
+<DT>Backus-Naur Form (BNF)
+<DD>
+Formal method of specifying context-free grammars.  BNF was first used
+in the <CITE>ALGOL-60</CITE> report, 1963.  See section <A HREF="bison.html#SEC8">Languages and Context-Free Grammars</A>.
+<DT>Context-free grammars
+<DD>
+Grammars specified as rules that can be applied regardless of context.
+Thus, if there is a rule which says that an integer can be used as an
+expression, integers are allowed <EM>anywhere</EM> an expression is
+permitted.  See section <A HREF="bison.html#SEC8">Languages and Context-Free Grammars</A>.
+<DT>Dynamic allocation
+<DD>
+Allocation of memory that occurs during execution, rather than at
+compile time or on entry to a function.
+<DT>Empty string
+<DD>
+Analogous to the empty set in set theory, the empty string is a
+character string of length zero.
+<DT>Finite-state stack machine
+<DD>
+A "machine" that has discrete states in which it is said to exist at
+each instant in time.  As input to the machine is processed, the
+machine moves from state to state as specified by the logic of the
+machine.  In the case of the parser, the input is the language being
+parsed, and the states correspond to various stages in the grammar
+rules.  See section <A HREF="bison.html#SEC68">The Bison Parser Algorithm</A>.
+<DT>Grouping
+<DD>
+A language construct that is (in general) grammatically divisible;
+for example, `expression' or `declaration' in C.  
+See section <A HREF="bison.html#SEC8">Languages and Context-Free Grammars</A>.
+<DT>Infix operator
+<DD>
+An arithmetic operator that is placed between the operands on which it
+performs some operation.
+<DT>Input stream
+<DD>
+A continuous flow of data between devices or programs.
+<DT>Language construct
+<DD>
+One of the typical usage schemas of the language.  For example, one of
+the constructs of the C language is the <CODE>if</CODE> statement.
+See section <A HREF="bison.html#SEC8">Languages and Context-Free Grammars</A>.
+<DT>Left associativity
+<DD>
+Operators having left associativity are analyzed from left to right:
+<SAMP>`a+b+c'</SAMP> first computes <SAMP>`a+b'</SAMP> and then combines with
+<SAMP>`c'</SAMP>.  See section <A HREF="bison.html#SEC71">Operator Precedence</A>.
+<DT>Left recursion
+<DD>
+A rule whose result symbol is also its first component symbol;
+for example, <SAMP>`expseq1 : expseq1 ',' exp;'</SAMP>.  See section <A HREF="bison.html#SEC42">Recursive Rules</A>.
+<DT>Left-to-right parsing
+<DD>
+Parsing a sentence of a language by analyzing it token by token from
+left to right.  See section <A HREF="bison.html#SEC68">The Bison Parser Algorithm</A>.
+<DT>Lexical analyzer (scanner)
+<DD>
+A function that reads an input stream and returns tokens one by one.
+See section <A HREF="bison.html#SEC61">The Lexical Analyzer Function <CODE>yylex</CODE></A>.
+<DT>Lexical tie-in
+<DD>
+A flag, set by actions in the grammar rules, which alters the way
+tokens are parsed.  See section <A HREF="bison.html#SEC84">Lexical Tie-ins</A>.
+<DT>Look-ahead token
+<DD>
+A token already read but not yet shifted.  See section <A HREF="bison.html#SEC69">Look-Ahead Tokens</A>.
+<DT>LALR(1)
+<DD>
+The class of context-free grammars that Bison (like most other parser
+generators) can handle; a subset of LR(1).  See section <A HREF="bison.html#SEC79">Mysterious Reduce/Reduce Conflicts</A>.
+<DT>LR(1)
+<DD>
+The class of context-free grammars in which at most one token of
+look-ahead is needed to disambiguate the parsing of any piece of input.
+<DT>Nonterminal symbol
+<DD>
+A grammar symbol standing for a grammatical construct that can
+be expressed through rules in terms of smaller constructs; in other
+words, a construct that is not a token.  See section <A HREF="bison.html#SEC40">Symbols, Terminal and Nonterminal</A>.
+<DT>Parse error
+<DD>
+An error encountered during parsing of an input stream due to invalid
+syntax.  See section <A HREF="bison.html#SEC81">Error Recovery</A>.
+<DT>Parser
+<DD>
+A function that recognizes valid sentences of a language by analyzing
+the syntax structure of a set of tokens passed to it from a lexical
+analyzer.
+<DT>Postfix operator
+<DD>
+An arithmetic operator that is placed after the operands upon which it
+performs some operation.
+<DT>Reduction
+<DD>
+Replacing a string of nonterminals and/or terminals with a single
+nonterminal, according to a grammar rule.  See section <A HREF="bison.html#SEC68">The Bison Parser Algorithm</A>.
+<DT>Reentrant
+<DD>
+A reentrant subprogram is a subprogram which can be in invoked any
+number of times in parallel, without interference between the various
+invocations.  See section <A HREF="bison.html#SEC56">A Pure (Reentrant) Parser</A>.
+<DT>Reverse polish notation
+<DD>
+A language in which all operators are postfix operators.
+<DT>Right recursion
+<DD>
+A rule whose result symbol is also its last component symbol;
+for example, <SAMP>`expseq1: exp ',' expseq1;'</SAMP>.  See section <A HREF="bison.html#SEC42">Recursive Rules</A>.
+<DT>Semantics
+<DD>
+In computer languages, the semantics are specified by the actions
+taken for each instance of the language, i.e., the meaning of
+each statement.  See section <A HREF="bison.html#SEC43">Defining Language Semantics</A>.
+<DT>Shift
+<DD>
+A parser is said to shift when it makes the choice of analyzing
+further input from the stream rather than reducing immediately some
+already-recognized rule.  See section <A HREF="bison.html#SEC68">The Bison Parser Algorithm</A>.
+<DT>Single-character literal
+<DD>
+A single character that is recognized and interpreted as is.
+See section <A HREF="bison.html#SEC9">From Formal Rules to Bison Input</A>.
+<DT>Start symbol
+<DD>
+The nonterminal symbol that stands for a complete valid utterance in
+the language being parsed.  The start symbol is usually listed as the
+first nonterminal symbol in a language specification.  
+See section <A HREF="bison.html#SEC55">The Start-Symbol</A>.
+<DT>Symbol table
+<DD>
+A data structure where symbol names and associated data are stored
+during parsing to allow for recognition and use of existing
+information in repeated uses of a symbol.  See section <A HREF="bison.html#SEC29">Multi-Function Calculator: <CODE>mfcalc</CODE></A>.
+<DT>Token
+<DD>
+A basic, grammatically indivisible unit of a language.  The symbol
+that describes a token in the grammar is a terminal symbol.
+The input of the Bison parser is a stream of tokens which comes from
+the lexical analyzer.  See section <A HREF="bison.html#SEC40">Symbols, Terminal and Nonterminal</A>.
+<DT>Terminal symbol
+<DD>
+A grammar symbol that has no rules in the grammar and therefore
+is grammatically indivisible.  The piece of text it represents
+is a token.  See section <A HREF="bison.html#SEC8">Languages and Context-Free Grammars</A>.
+</DL>
+<P>
+<H1><A NAME="SEC93" HREF="bison.html#TOC93">Index</A></H1>
+<P>
+Jump to:
+<A HREF="#$">$</A>
+-
+<A HREF="#%">%</A>
+-
+<A HREF="#@">@</A>
+-
+<A HREF="#a">a</A>
+-
+<A HREF="#b">b</A>
+-
+<A HREF="#c">c</A>
+-
+<A HREF="#d">d</A>
+-
+<A HREF="#e">e</A>
+-
+<A HREF="#f">f</A>
+-
+<A HREF="#g">g</A>
+-
+<A HREF="#i">i</A>
+-
+<A HREF="#l">l</A>
+-
+<A HREF="#m">m</A>
+-
+<A HREF="#n">n</A>
+-
+<A HREF="#o">o</A>
+-
+<A HREF="#p">p</A>
+-
+<A HREF="#r">r</A>
+-
+<A HREF="#s">s</A>
+-
+<A HREF="#t">t</A>
+-
+<A HREF="#u">u</A>
+-
+<A HREF="#v">v</A>
+-
+<A HREF="#w">w</A>
+-
+<A HREF="#y">y</A>
+-
+<A HREF="#|">|</A>
+<P>
+<H2><A NAME="$">$</A></H2>
+<DIR>
+<LI><A HREF="bison.html#IDX80">$$</A>
+<LI><A HREF="bison.html#IDX81">$<VAR>n</VAR></A>
+</DIR>
+<H2><A NAME="%">%</A></H2>
+<DIR>
+<LI><A HREF="bison.html#IDX105">%expect</A>
+<LI><A HREF="bison.html#IDX155">%left</A>
+<LI><A HREF="bison.html#IDX157">%nonassoc</A>
+<LI><A HREF="bison.html#IDX162">%prec</A>
+<LI><A HREF="bison.html#IDX112">%pure_parser</A>
+<LI><A HREF="bison.html#IDX156">%right</A>
+<LI><A HREF="bison.html#IDX109">%start</A>
+<LI><A HREF="bison.html#IDX91">%token</A>
+<LI><A HREF="bison.html#IDX100">%type</A>
+<LI><A HREF="bison.html#IDX97">%union</A>
+</DIR>
+<H2><A NAME="@">@</A></H2>
+<DIR>
+<LI><A HREF="bison.html#IDX139">@<VAR>n</VAR></A>
+</DIR>
+<H2><A NAME="a">a</A></H2>
+<DIR>
+<LI><A HREF="bison.html#IDX79">action</A>
+<LI><A HREF="bison.html#IDX83">action data types</A>
+<LI><A HREF="bison.html#IDX135">action features summary</A>
+<LI><A HREF="bison.html#IDX85">actions in mid-rule</A>
+<LI><A HREF="bison.html#IDX17">actions, semantic</A>
+<LI><A HREF="bison.html#IDX56">additional C code section</A>
+<LI><A HREF="bison.html#IDX141">algorithm of parser</A>
+<LI><A HREF="bison.html#IDX154">associativity</A>
+</DIR>
+<H2><A NAME="b">b</A></H2>
+<DIR>
+<LI><A HREF="bison.html#IDX5">Backus-Naur form</A>
+<LI><A HREF="bison.html#IDX113">Bison declaration summary</A>
+<LI><A HREF="bison.html#IDX88">Bison declarations</A>
+<LI><A HREF="bison.html#IDX52">Bison declarations (introduction)</A>
+<LI><A HREF="bison.html#IDX11">Bison grammar</A>
+<LI><A HREF="bison.html#IDX189">Bison invocation</A>
+<LI><A HREF="bison.html#IDX18">Bison parser</A>
+<LI><A HREF="bison.html#IDX140">Bison parser algorithm</A>
+<LI><A HREF="bison.html#IDX193">Bison symbols, table of</A>
+<LI><A HREF="bison.html#IDX19">Bison utility</A>
+<LI><A HREF="bison.html#IDX4">BNF</A>
+</DIR>
+<H2><A NAME="c">c</A></H2>
+<DIR>
+<LI><A HREF="bison.html#IDX57">C code, section for additional</A>
+<LI><A HREF="bison.html#IDX50">C declarations section</A>
+<LI><A HREF="bison.html#IDX116">C-language interface</A>
+<LI><A HREF="bison.html#IDX42"><CODE>calc</CODE></A>
+<LI><A HREF="bison.html#IDX43">calculator, infix notation</A>
+<LI><A HREF="bison.html#IDX47">calculator, multi-function</A>
+<LI><A HREF="bison.html#IDX33">calculator, simple</A>
+<LI><A HREF="bison.html#IDX62">character token</A>
+<LI><A HREF="bison.html#IDX40">compiling the parser</A>
+<LI><A HREF="bison.html#IDX148">conflicts</A>
+<LI><A HREF="bison.html#IDX167">conflicts, reduce/reduce</A>
+<LI><A HREF="bison.html#IDX104">conflicts, suppressing warnings of</A>
+<LI><A HREF="bison.html#IDX158">context-dependent precedence</A>
+<LI><A HREF="bison.html#IDX2">context-free grammar</A>
+<LI><A HREF="bison.html#IDX36">controlling function</A>
+</DIR>
+<H2><A NAME="d">d</A></H2>
+<DIR>
+<LI><A HREF="bison.html#IDX150">dangling <CODE>else</CODE></A>
+<LI><A HREF="bison.html#IDX84">data types in actions</A>
+<LI><A HREF="bison.html#IDX77">data types of semantic values</A>
+<LI><A HREF="bison.html#IDX185">debugging</A>
+<LI><A HREF="bison.html#IDX114">declaration summary</A>
+<LI><A HREF="bison.html#IDX87">declarations, Bison</A>
+<LI><A HREF="bison.html#IDX53">declarations, Bison (introduction)</A>
+<LI><A HREF="bison.html#IDX51">declarations, C</A>
+<LI><A HREF="bison.html#IDX93">declaring operator precedence</A>
+<LI><A HREF="bison.html#IDX106">declaring the start symbol</A>
+<LI><A HREF="bison.html#IDX89">declaring token type names</A>
+<LI><A HREF="bison.html#IDX95">declaring value types</A>
+<LI><A HREF="bison.html#IDX98">declaring value types, nonterminals</A>
+<LI><A HREF="bison.html#IDX82">default action</A>
+<LI><A HREF="bison.html#IDX78">default data type</A>
+<LI><A HREF="bison.html#IDX174">default stack limit</A>
+<LI><A HREF="bison.html#IDX108">default start symbol</A>
+<LI><A HREF="bison.html#IDX73">defining language semantics</A>
+</DIR>
+<H2><A NAME="e">e</A></H2>
+<DIR>
+<LI><A HREF="bison.html#IDX151"><CODE>else</CODE>, dangling</A>
+<LI><A HREF="bison.html#IDX178">error</A>
+<LI><A HREF="bison.html#IDX176">error recovery</A>
+<LI><A HREF="bison.html#IDX44">error recovery, simple</A>
+<LI><A HREF="bison.html#IDX128">error reporting function</A>
+<LI><A HREF="bison.html#IDX38">error reporting routine</A>
+<LI><A HREF="bison.html#IDX29">examples, simple</A>
+<LI><A HREF="bison.html#IDX49">exercises</A>
+</DIR>
+<H2><A NAME="f">f</A></H2>
+<DIR>
+<LI><A HREF="bison.html#IDX25">file format</A>
+<LI><A HREF="bison.html#IDX163">finite-state machine</A>
+<LI><A HREF="bison.html#IDX13">formal grammar</A>
+<LI><A HREF="bison.html#IDX26">format of grammar file</A>
+</DIR>
+<H2><A NAME="g">g</A></H2>
+<DIR>
+<LI><A HREF="bison.html#IDX195">glossary</A>
+<LI><A HREF="bison.html#IDX24">grammar file</A>
+<LI><A HREF="bison.html#IDX66">grammar rule syntax</A>
+<LI><A HREF="bison.html#IDX54">grammar rules section</A>
+<LI><A HREF="bison.html#IDX12">grammar, Bison</A>
+<LI><A HREF="bison.html#IDX3">grammar, context-free</A>
+<LI><A HREF="bison.html#IDX9">grouping, syntactic</A>
+</DIR>
+<H2><A NAME="i">i</A></H2>
+<DIR>
+<LI><A HREF="bison.html#IDX41">infix notation calculator</A>
+<LI><A HREF="bison.html#IDX117">interface</A>
+<LI><A HREF="bison.html#IDX1">introduction</A>
+<LI><A HREF="bison.html#IDX188">invoking Bison</A>
+<LI><A HREF="bison.html#IDX191">invoking Bison under VMS</A>
+</DIR>
+<H2><A NAME="l">l</A></H2>
+<DIR>
+<LI><A HREF="bison.html#IDX169">LALR(1)</A>
+<LI><A HREF="bison.html#IDX74">language semantics, defining</A>
+<LI><A HREF="bison.html#IDX27">layout of Bison grammar</A>
+<LI><A HREF="bison.html#IDX70">left recursion</A>
+<LI><A HREF="bison.html#IDX122">lexical analyzer</A>
+<LI><A HREF="bison.html#IDX20">lexical analyzer, purpose</A>
+<LI><A HREF="bison.html#IDX35">lexical analyzer, writing</A>
+<LI><A HREF="bison.html#IDX182">lexical tie-in</A>
+<LI><A HREF="bison.html#IDX63">literal token</A>
+<LI><A HREF="bison.html#IDX146">look-ahead token</A>
+<LI><A HREF="bison.html#IDX168">LR(1)</A>
+</DIR>
+<H2><A NAME="m">m</A></H2>
+<DIR>
+<LI><A HREF="bison.html#IDX37">main function in simple example</A>
+<LI><A HREF="bison.html#IDX46"><CODE>mfcalc</CODE></A>
+<LI><A HREF="bison.html#IDX86">mid-rule actions</A>
+<LI><A HREF="bison.html#IDX45">multi-function calculator</A>
+<LI><A HREF="bison.html#IDX72">mutual recursion</A>
+</DIR>
+<H2><A NAME="n">n</A></H2>
+<DIR>
+<LI><A HREF="bison.html#IDX58">nonterminal symbol</A>
+</DIR>
+<H2><A NAME="o">o</A></H2>
+<DIR>
+<LI><A HREF="bison.html#IDX152">operator precedence</A>
+<LI><A HREF="bison.html#IDX94">operator precedence, declaring</A>
+<LI><A HREF="bison.html#IDX190">options for invoking Bison</A>
+<LI><A HREF="bison.html#IDX172">overflow of parser stack</A>
+</DIR>
+<H2><A NAME="p">p</A></H2>
+<DIR>
+<LI><A HREF="bison.html#IDX130">parse error</A>
+<LI><A HREF="bison.html#IDX21">parser</A>
+<LI><A HREF="bison.html#IDX144">parser stack</A>
+<LI><A HREF="bison.html#IDX171">parser stack overflow</A>
+<LI><A HREF="bison.html#IDX164">parser state</A>
+<LI><A HREF="bison.html#IDX31">polish notation calculator</A>
+<LI><A HREF="bison.html#IDX92">precedence declarations</A>
+<LI><A HREF="bison.html#IDX153">precedence of operators</A>
+<LI><A HREF="bison.html#IDX160">precedence, context-dependent</A>
+<LI><A HREF="bison.html#IDX161">precedence, unary operator</A>
+<LI><A HREF="bison.html#IDX102">preventing warnings about conflicts</A>
+<LI><A HREF="bison.html#IDX111">pure parser</A>
+</DIR>
+<H2><A NAME="r">r</A></H2>
+<DIR>
+<LI><A HREF="bison.html#IDX177">recovery from errors</A>
+<LI><A HREF="bison.html#IDX69">recursive rule</A>
+<LI><A HREF="bison.html#IDX166">reduce/reduce conflict</A>
+<LI><A HREF="bison.html#IDX143">reduction</A>
+<LI><A HREF="bison.html#IDX110">reentrant parser</A>
+<LI><A HREF="bison.html#IDX30">reverse polish notation</A>
+<LI><A HREF="bison.html#IDX71">right recursion</A>
+<LI><A HREF="bison.html#IDX32"><CODE>rpcalc</CODE></A>
+<LI><A HREF="bison.html#IDX65">rule syntax</A>
+<LI><A HREF="bison.html#IDX55">rules section for grammar</A>
+<LI><A HREF="bison.html#IDX39">running Bison (introduction)</A>
+</DIR>
+<H2><A NAME="s">s</A></H2>
+<DIR>
+<LI><A HREF="bison.html#IDX16">semantic actions</A>
+<LI><A HREF="bison.html#IDX14">semantic value</A>
+<LI><A HREF="bison.html#IDX75">semantic value type</A>
+<LI><A HREF="bison.html#IDX149">shift/reduce conflicts</A>
+<LI><A HREF="bison.html#IDX142">shifting</A>
+<LI><A HREF="bison.html#IDX28">simple examples</A>
+<LI><A HREF="bison.html#IDX64">single-character literal</A>
+<LI><A HREF="bison.html#IDX170">stack overflow</A>
+<LI><A HREF="bison.html#IDX145">stack, parser</A>
+<LI><A HREF="bison.html#IDX22">stages in using Bison</A>
+<LI><A HREF="bison.html#IDX10">start symbol</A>
+<LI><A HREF="bison.html#IDX107">start symbol, declaring</A>
+<LI><A HREF="bison.html#IDX165">state (of parser)</A>
+<LI><A HREF="bison.html#IDX134">summary, action features</A>
+<LI><A HREF="bison.html#IDX115">summary, Bison declaration</A>
+<LI><A HREF="bison.html#IDX101">suppressing conflict warnings</A>
+<LI><A HREF="bison.html#IDX61">symbol</A>
+<LI><A HREF="bison.html#IDX48">symbol table example</A>
+<LI><A HREF="bison.html#IDX6">symbols (abstract)</A>
+<LI><A HREF="bison.html#IDX194">symbols in Bison, table of</A>
+<LI><A HREF="bison.html#IDX8">syntactic grouping</A>
+<LI><A HREF="bison.html#IDX131">syntax error</A>
+<LI><A HREF="bison.html#IDX67">syntax of grammar rules</A>
+</DIR>
+<H2><A NAME="t">t</A></H2>
+<DIR>
+<LI><A HREF="bison.html#IDX59">terminal symbol</A>
+<LI><A HREF="bison.html#IDX7">token</A>
+<LI><A HREF="bison.html#IDX60">token type</A>
+<LI><A HREF="bison.html#IDX90">token type names, declaring</A>
+<LI><A HREF="bison.html#IDX186">tracing the parser</A>
+</DIR>
+<H2><A NAME="u">u</A></H2>
+<DIR>
+<LI><A HREF="bison.html#IDX159">unary operator precedence</A>
+<LI><A HREF="bison.html#IDX23">using Bison</A>
+</DIR>
+<H2><A NAME="v">v</A></H2>
+<DIR>
+<LI><A HREF="bison.html#IDX76">value type, semantic</A>
+<LI><A HREF="bison.html#IDX96">value types, declaring</A>
+<LI><A HREF="bison.html#IDX99">value types, nonterminals, declaring</A>
+<LI><A HREF="bison.html#IDX15">value, semantic</A>
+<LI><A HREF="bison.html#IDX192">VMS</A>
+</DIR>
+<H2><A NAME="w">w</A></H2>
+<DIR>
+<LI><A HREF="bison.html#IDX103">warnings, preventing</A>
+<LI><A HREF="bison.html#IDX34">writing a lexical analyzer</A>
+</DIR>
+<H2><A NAME="y">y</A></H2>
+<DIR>
+<LI><A HREF="bison.html#IDX120">YYABORT</A>
+<LI><A HREF="bison.html#IDX119">YYACCEPT</A>
+<LI><A HREF="bison.html#IDX136">YYBACKUP</A>
+<LI><A HREF="bison.html#IDX147">yychar</A>
+<LI><A HREF="bison.html#IDX180">yyclearin</A>
+<LI><A HREF="bison.html#IDX183">YYDEBUG</A>
+<LI><A HREF="bison.html#IDX184">yydebug</A>
+<LI><A HREF="bison.html#IDX137">YYEMPTY</A>
+<LI><A HREF="bison.html#IDX179">yyerrok</A>
+<LI><A HREF="bison.html#IDX129">yyerror</A>
+<LI><A HREF="bison.html#IDX138">YYERROR</A>
+<LI><A HREF="bison.html#IDX132">YYERROR_VERBOSE</A>
+<LI><A HREF="bison.html#IDX175">YYINITDEPTH</A>
+<LI><A HREF="bison.html#IDX121">yylex</A>
+<LI><A HREF="bison.html#IDX127">YYLEX_PARAM</A>
+<LI><A HREF="bison.html#IDX124">yylloc</A>
+<LI><A HREF="bison.html#IDX125">YYLTYPE</A>
+<LI><A HREF="bison.html#IDX123">yylval</A>
+<LI><A HREF="bison.html#IDX173">YYMAXDEPTH</A>
+<LI><A HREF="bison.html#IDX133">yynerrs</A>
+<LI><A HREF="bison.html#IDX118">yyparse</A>
+<LI><A HREF="bison.html#IDX126">YYPARSE_PARAM</A>
+<LI><A HREF="bison.html#IDX187">YYPRINT</A>
+<LI><A HREF="bison.html#IDX181">YYRECOVERING</A>
+</DIR>
+<H2><A NAME="|">|</A></H2>
+<DIR>
+<LI><A HREF="bison.html#IDX68">|</A>
+</DIR>
+<P><HR><P>
+This document was generated on 2 October 1998 using the
+<A HREF="http://wwwinfo.cern.ch/dis/texi2html/">texi2html</A>
+translator version 1.52.</P>
+</BODY>
+</HTML>

Engine/bin/bison/bison.simple

@@ -0,0 +1,686 @@
+/* -*-C-*-  Note some compilers choke on comments on `#line' lines.  */
+#line 3 "bison.simple"
+
+/* Skeleton output parser for bison,
+   Copyright (C) 1984, 1989, 1990 Free Software Foundation, Inc.
+
+   This program is free software; you can redistribute it and/or modify
+   it under the terms of the GNU General Public License as published by
+   the Free Software Foundation; either version 2, or (at your option)
+   any later version.
+
+   This program is distributed in the hope that it will be useful,
+   but WITHOUT ANY WARRANTY; without even the implied warranty of
+   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+   GNU General Public License for more details.
+
+   You should have received a copy of the GNU General Public License
+   along with this program; if not, write to the Free Software
+   Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA.  */
+
+/* As a special exception, when this file is copied by Bison into a
+   Bison output file, you may use that output file without restriction.
+   This special exception was added by the Free Software Foundation
+   in version 1.24 of Bison.  */
+
+#ifndef alloca
+#ifdef __GNUC__
+#define alloca __builtin_alloca
+#else /* not GNU C.  */
+#if (!defined (__STDC__) && defined (sparc)) || defined (__sparc__) || defined (__sparc) || defined (__sgi)
+#include <alloca.h>
+#else /* not sparc */
+#if defined (MSDOS) && !defined (__TURBOC__)
+#include <malloc.h>
+#else /* not MSDOS, or __TURBOC__ */
+#if defined(_AIX)
+#include <malloc.h>
+ #pragma alloca
+#else /* not MSDOS, __TURBOC__, or _AIX */
+#ifdef __hpux
+#ifdef __cplusplus
+extern "C" {
+void *alloca (unsigned int);
+};
+#else /* not __cplusplus */
+void *alloca ();
+#endif /* not __cplusplus */
+#endif /* __hpux */
+#endif /* not _AIX */
+#endif /* not MSDOS, or __TURBOC__ */
+#endif /* not sparc.  */
+#endif /* not GNU C.  */
+#endif /* alloca not defined.  */
+
+/* This is the parser code that is written into each bison parser
+  when the %semantic_parser declaration is not specified in the grammar.
+  It was written by Richard Stallman by simplifying the hairy parser
+  used when %semantic_parser is specified.  */
+
+/* Note: there must be only one dollar sign in this file.
+   It is replaced by the list of actions, each action
+   as one case of the switch.  */
+
+#define yyerrok		(yyerrstatus = 0)
+#define yyclearin	(yychar = YYEMPTY)
+#define YYEMPTY		-2
+#define YYEOF		0
+#define YYACCEPT	return(0)
+#define YYABORT 	return(1)
+#define YYERROR		goto yyerrlab1
+/* Like YYERROR except do call yyerror.
+   This remains here temporarily to ease the
+   transition to the new meaning of YYERROR, for GCC.
+   Once GCC version 2 has supplanted version 1, this can go.  */
+#define YYFAIL		goto yyerrlab
+#define YYRECOVERING()  (!!yyerrstatus)
+#define YYBACKUP(token, value) \
+do								\
+  if (yychar == YYEMPTY && yylen == 1)				\
+    { yychar = (token), yylval = (value);			\
+      yychar1 = YYTRANSLATE (yychar);				\
+      YYPOPSTACK;						\
+      goto yybackup;						\
+    }								\
+  else								\
+    { yyerror ("syntax error: cannot back up"); YYERROR; }	\
+while (0)
+
+#define YYTERROR	1
+#define YYERRCODE	256
+
+#ifndef YYPURE
+#define YYLEX		yylex()
+#endif
+
+#ifdef YYPURE
+#ifdef YYLSP_NEEDED
+#ifdef YYLEX_PARAM
+#define YYLEX		yylex(&yylval, &yylloc, YYLEX_PARAM)
+#else
+#define YYLEX		yylex(&yylval, &yylloc)
+#endif
+#else /* not YYLSP_NEEDED */
+#ifdef YYLEX_PARAM
+#define YYLEX		yylex(&yylval, YYLEX_PARAM)
+#else
+#define YYLEX		yylex(&yylval)
+#endif
+#endif /* not YYLSP_NEEDED */
+#endif
+
+/* If nonreentrant, generate the variables here */
+
+#ifndef YYPURE
+
+int	yychar;			/*  the lookahead symbol		*/
+YYSTYPE	yylval;			/*  the semantic value of the		*/
+				/*  lookahead symbol			*/
+
+#ifdef YYLSP_NEEDED
+YYLTYPE yylloc;			/*  location data for the lookahead	*/
+				/*  symbol				*/
+#endif
+
+int yynerrs;			/*  number of parse errors so far       */
+#endif  /* not YYPURE */
+
+#if YYDEBUG != 0
+int yydebug;			/*  nonzero means print parse trace	*/
+/* Since this is uninitialized, it does not stop multiple parsers
+   from coexisting.  */
+#endif
+
+/*  YYINITDEPTH indicates the initial size of the parser's stacks	*/
+
+#ifndef	YYINITDEPTH
+#define YYINITDEPTH 200
+#endif
+
+/*  YYMAXDEPTH is the maximum size the stacks can grow to
+    (effective only if the built-in stack extension method is used).  */
+
+#if YYMAXDEPTH == 0
+#undef YYMAXDEPTH
+#endif
+
+#ifndef YYMAXDEPTH
+#define YYMAXDEPTH 10000
+#endif
+
+/* Prevent warning if -Wstrict-prototypes.  */
+#ifdef __GNUC__
+int yyparse (void);
+#endif
+
+#if __GNUC__ > 1		/* GNU C and GNU C++ define this.  */
+#define __yy_memcpy(FROM,TO,COUNT)	__builtin_memcpy(TO,FROM,COUNT)
+#else				/* not GNU C or C++ */
+#ifndef __cplusplus
+
+/* This is the most reliable way to avoid incompatibilities
+   in available built-in functions on various systems.  */
+static void
+__yy_memcpy (from, to, count)
+     char *from;
+     char *to;
+     int count;
+{
+  register char *f = from;
+  register char *t = to;
+  register int i = count;
+
+  while (i-- > 0)
+    *t++ = *f++;
+}
+
+#else /* __cplusplus */
+
+/* This is the most reliable way to avoid incompatibilities
+   in available built-in functions on various systems.  */
+static void
+__yy_memcpy (char *from, char *to, int count)
+{
+  register char *f = from;
+  register char *t = to;
+  register int i = count;
+
+  while (i-- > 0)
+    *t++ = *f++;
+}
+
+#endif
+#endif
+
+#line 192 "bison.simple"
+
+/* The user can define YYPARSE_PARAM as the name of an argument to be passed
+   into yyparse.  The argument should have type void *.
+   It should actually point to an object.
+   Grammar actions can access the variable by casting it
+   to the proper pointer type.  */
+
+#ifdef YYPARSE_PARAM
+#define YYPARSE_PARAM_DECL void *YYPARSE_PARAM;
+#else
+#define YYPARSE_PARAM
+#define YYPARSE_PARAM_DECL
+#endif
+
+int
+yyparse(YYPARSE_PARAM)
+     YYPARSE_PARAM_DECL
+{
+  register int yystate;
+  register int yyn;
+  register short *yyssp;
+  register YYSTYPE *yyvsp;
+  int yyerrstatus;	/*  number of tokens to shift before error messages enabled */
+  int yychar1 = 0;		/*  lookahead token as an internal (translated) token number */
+
+  short	yyssa[YYINITDEPTH];	/*  the state stack			*/
+  YYSTYPE yyvsa[YYINITDEPTH];	/*  the semantic value stack		*/
+
+  short *yyss = yyssa;		/*  refer to the stacks thru separate pointers */
+  YYSTYPE *yyvs = yyvsa;	/*  to allow yyoverflow to reallocate them elsewhere */
+
+#ifdef YYLSP_NEEDED
+  YYLTYPE yylsa[YYINITDEPTH];	/*  the location stack			*/
+  YYLTYPE *yyls = yylsa;
+  YYLTYPE *yylsp;
+
+#define YYPOPSTACK   (yyvsp--, yyssp--, yylsp--)
+#else
+#define YYPOPSTACK   (yyvsp--, yyssp--)
+#endif
+
+  int yystacksize = YYINITDEPTH;
+
+#ifdef YYPURE
+  int yychar;
+  YYSTYPE yylval;
+  int yynerrs;
+#ifdef YYLSP_NEEDED
+  YYLTYPE yylloc;
+#endif
+#endif
+
+  YYSTYPE yyval;		/*  the variable used to return		*/
+				/*  semantic values from the action	*/
+				/*  routines				*/
+
+  int yylen;
+
+#if YYDEBUG != 0
+  if (yydebug)
+    fprintf(stderr, "Starting parse\n");
+#endif
+
+  yystate = 0;
+  yyerrstatus = 0;
+  yynerrs = 0;
+  yychar = YYEMPTY;		/* Cause a token to be read.  */
+
+  /* Initialize stack pointers.
+     Waste one element of value and location stack
+     so that they stay on the same level as the state stack.
+     The wasted elements are never initialized.  */
+
+  yyssp = yyss - 1;
+  yyvsp = yyvs;
+#ifdef YYLSP_NEEDED
+  yylsp = yyls;
+#endif
+
+/* Push a new state, which is found in  yystate  .  */
+/* In all cases, when you get here, the value and location stacks
+   have just been pushed. so pushing a state here evens the stacks.  */
+yynewstate:
+
+  *++yyssp = yystate;
+
+  if (yyssp >= yyss + yystacksize - 1)
+    {
+      /* Give user a chance to reallocate the stack */
+      /* Use copies of these so that the &'s don't force the real ones into memory. */
+      YYSTYPE *yyvs1 = yyvs;
+      short *yyss1 = yyss;
+#ifdef YYLSP_NEEDED
+      YYLTYPE *yyls1 = yyls;
+#endif
+
+      /* Get the current used size of the three stacks, in elements.  */
+      int size = yyssp - yyss + 1;
+
+#ifdef yyoverflow
+      /* Each stack pointer address is followed by the size of
+	 the data in use in that stack, in bytes.  */
+#ifdef YYLSP_NEEDED
+      /* This used to be a conditional around just the two extra args,
+	 but that might be undefined if yyoverflow is a macro.  */
+      yyoverflow("parser stack overflow",
+		 &yyss1, size * sizeof (*yyssp),
+		 &yyvs1, size * sizeof (*yyvsp),
+		 &yyls1, size * sizeof (*yylsp),
+		 &yystacksize);
+#else
+      yyoverflow("parser stack overflow",
+		 &yyss1, size * sizeof (*yyssp),
+		 &yyvs1, size * sizeof (*yyvsp),
+		 &yystacksize);
+#endif
+
+      yyss = yyss1; yyvs = yyvs1;
+#ifdef YYLSP_NEEDED
+      yyls = yyls1;
+#endif
+#else /* no yyoverflow */
+      /* Extend the stack our own way.  */
+      if (yystacksize >= YYMAXDEPTH)
+	{
+	  yyerror("parser stack overflow");
+	  return 2;
+	}
+      yystacksize *= 2;
+      if (yystacksize > YYMAXDEPTH)
+	yystacksize = YYMAXDEPTH;
+      yyss = (short *) alloca (yystacksize * sizeof (*yyssp));
+      __yy_memcpy ((char *)yyss1, (char *)yyss, size * sizeof (*yyssp));
+      yyvs = (YYSTYPE *) alloca (yystacksize * sizeof (*yyvsp));
+      __yy_memcpy ((char *)yyvs1, (char *)yyvs, size * sizeof (*yyvsp));
+#ifdef YYLSP_NEEDED
+      yyls = (YYLTYPE *) alloca (yystacksize * sizeof (*yylsp));
+      __yy_memcpy ((char *)yyls1, (char *)yyls, size * sizeof (*yylsp));
+#endif
+#endif /* no yyoverflow */
+
+      yyssp = yyss + size - 1;
+      yyvsp = yyvs + size - 1;
+#ifdef YYLSP_NEEDED
+      yylsp = yyls + size - 1;
+#endif
+
+#if YYDEBUG != 0
+      if (yydebug)
+	fprintf(stderr, "Stack size increased to %d\n", yystacksize);
+#endif
+
+      if (yyssp >= yyss + yystacksize - 1)
+	YYABORT;
+    }
+
+#if YYDEBUG != 0
+  if (yydebug)
+    fprintf(stderr, "Entering state %d\n", yystate);
+#endif
+
+  goto yybackup;
+ yybackup:
+
+/* Do appropriate processing given the current state.  */
+/* Read a lookahead token if we need one and don't already have one.  */
+/* yyresume: */
+
+  /* First try to decide what to do without reference to lookahead token.  */
+
+  yyn = yypact[yystate];
+  if (yyn == YYFLAG)
+    goto yydefault;
+
+  /* Not known => get a lookahead token if don't already have one.  */
+
+  /* yychar is either YYEMPTY or YYEOF
+     or a valid token in external form.  */
+
+  if (yychar == YYEMPTY)
+    {
+#if YYDEBUG != 0
+      if (yydebug)
+	fprintf(stderr, "Reading a token: ");
+#endif
+      yychar = YYLEX;
+    }
+
+  /* Convert token to internal form (in yychar1) for indexing tables with */
+
+  if (yychar <= 0)		/* This means end of input. */
+    {
+      yychar1 = 0;
+      yychar = YYEOF;		/* Don't call YYLEX any more */
+
+#if YYDEBUG != 0
+      if (yydebug)
+	fprintf(stderr, "Now at end of input.\n");
+#endif
+    }
+  else
+    {
+      yychar1 = YYTRANSLATE(yychar);
+
+#if YYDEBUG != 0
+      if (yydebug)
+	{
+	  fprintf (stderr, "Next token is %d (%s", yychar, yytname[yychar1]);
+	  /* Give the individual parser a way to print the precise meaning
+	     of a token, for further debugging info.  */
+#ifdef YYPRINT
+	  YYPRINT (stderr, yychar, yylval);
+#endif
+	  fprintf (stderr, ")\n");
+	}
+#endif
+    }
+
+  yyn += yychar1;
+  if (yyn < 0 || yyn > YYLAST || yycheck[yyn] != yychar1)
+    goto yydefault;
+
+  yyn = yytable[yyn];
+
+  /* yyn is what to do for this token type in this state.
+     Negative => reduce, -yyn is rule number.
+     Positive => shift, yyn is new state.
+       New state is final state => don't bother to shift,
+       just return success.
+     0, or most negative number => error.  */
+
+  if (yyn < 0)
+    {
+      if (yyn == YYFLAG)
+	goto yyerrlab;
+      yyn = -yyn;
+      goto yyreduce;
+    }
+  else if (yyn == 0)
+    goto yyerrlab;
+
+  if (yyn == YYFINAL)
+    YYACCEPT;
+
+  /* Shift the lookahead token.  */
+
+#if YYDEBUG != 0
+  if (yydebug)
+    fprintf(stderr, "Shifting token %d (%s), ", yychar, yytname[yychar1]);
+#endif
+
+  /* Discard the token being shifted unless it is eof.  */
+  if (yychar != YYEOF)
+    yychar = YYEMPTY;
+
+  *++yyvsp = yylval;
+#ifdef YYLSP_NEEDED
+  *++yylsp = yylloc;
+#endif
+
+  /* count tokens shifted since error; after three, turn off error status.  */
+  if (yyerrstatus) yyerrstatus--;
+
+  yystate = yyn;
+  goto yynewstate;
+
+/* Do the default action for the current state.  */
+yydefault:
+
+  yyn = yydefact[yystate];
+  if (yyn == 0)
+    goto yyerrlab;
+
+/* Do a reduction.  yyn is the number of a rule to reduce with.  */
+yyreduce:
+  yylen = yyr2[yyn];
+  if (yylen > 0)
+    yyval = yyvsp[1-yylen]; /* implement default value of the action */
+
+#if YYDEBUG != 0
+  if (yydebug)
+    {
+      int i;
+
+      fprintf (stderr, "Reducing via rule %d (line %d), ",
+	       yyn, yyrline[yyn]);
+
+      /* Print the symbols being reduced, and their result.  */
+      for (i = yyprhs[yyn]; yyrhs[i] > 0; i++)
+	fprintf (stderr, "%s ", yytname[yyrhs[i]]);
+      fprintf (stderr, " -> %s\n", yytname[yyr1[yyn]]);
+    }
+#endif
+
+$   /* the action file gets copied in in place of this dollarsign */
+#line 487 "bison.simple"
+
+  yyvsp -= yylen;
+  yyssp -= yylen;
+#ifdef YYLSP_NEEDED
+  yylsp -= yylen;
+#endif
+
+#if YYDEBUG != 0
+  if (yydebug)
+    {
+      short *ssp1 = yyss - 1;
+      fprintf (stderr, "state stack now");
+      while (ssp1 != yyssp)
+	fprintf (stderr, " %d", *++ssp1);
+      fprintf (stderr, "\n");
+    }
+#endif
+
+  *++yyvsp = yyval;
+
+#ifdef YYLSP_NEEDED
+  yylsp++;
+  if (yylen == 0)
+    {
+      yylsp->first_line = yylloc.first_line;
+      yylsp->first_column = yylloc.first_column;
+      yylsp->last_line = (yylsp-1)->last_line;
+      yylsp->last_column = (yylsp-1)->last_column;
+      yylsp->text = 0;
+    }
+  else
+    {
+      yylsp->last_line = (yylsp+yylen-1)->last_line;
+      yylsp->last_column = (yylsp+yylen-1)->last_column;
+    }
+#endif
+
+  /* Now "shift" the result of the reduction.
+     Determine what state that goes to,
+     based on the state we popped back to
+     and the rule number reduced by.  */
+
+  yyn = yyr1[yyn];
+
+  yystate = yypgoto[yyn - YYNTBASE] + *yyssp;
+  if (yystate >= 0 && yystate <= YYLAST && yycheck[yystate] == *yyssp)
+    yystate = yytable[yystate];
+  else
+    yystate = yydefgoto[yyn - YYNTBASE];
+
+  goto yynewstate;
+
+yyerrlab:   /* here on detecting error */
+
+  if (! yyerrstatus)
+    /* If not already recovering from an error, report this error.  */
+    {
+      ++yynerrs;
+
+#ifdef YYERROR_VERBOSE
+      yyn = yypact[yystate];
+
+      if (yyn > YYFLAG && yyn < YYLAST)
+	{
+	  int size = 0;
+	  char *msg;
+	  int x, count;
+
+	  count = 0;
+	  /* Start X at -yyn if nec to avoid negative indexes in yycheck.  */
+	  for (x = (yyn < 0 ? -yyn : 0);
+	       x < (sizeof(yytname) / sizeof(char *)); x++)
+	    if (yycheck[x + yyn] == x)
+	      size += strlen(yytname[x]) + 15, count++;
+	  msg = (char *) malloc(size + 15);
+	  if (msg != 0)
+	    {
+	      strcpy(msg, "parse error");
+
+	      if (count < 5)
+		{
+		  count = 0;
+		  for (x = (yyn < 0 ? -yyn : 0);
+		       x < (sizeof(yytname) / sizeof(char *)); x++)
+		    if (yycheck[x + yyn] == x)
+		      {
+			strcat(msg, count == 0 ? ", expecting `" : " or `");
+			strcat(msg, yytname[x]);
+			strcat(msg, "'");
+			count++;
+		      }
+		}
+	      yyerror(msg);
+	      free(msg);
+	    }
+	  else
+	    yyerror ("parse error; also virtual memory exceeded");
+	}
+      else
+#endif /* YYERROR_VERBOSE */
+	yyerror("parse error");
+    }
+
+  goto yyerrlab1;
+yyerrlab1:   /* here on error raised explicitly by an action */
+
+  if (yyerrstatus == 3)
+    {
+      /* if just tried and failed to reuse lookahead token after an error, discard it.  */
+
+      /* return failure if at end of input */
+      if (yychar == YYEOF)
+	YYABORT;
+
+#if YYDEBUG != 0
+      if (yydebug)
+	fprintf(stderr, "Discarding token %d (%s).\n", yychar, yytname[yychar1]);
+#endif
+
+      yychar = YYEMPTY;
+    }
+
+  /* Else will try to reuse lookahead token
+     after shifting the error token.  */
+
+  yyerrstatus = 3;		/* Each real token shifted decrements this */
+
+  goto yyerrhandle;
+
+yyerrdefault:  /* current state does not do anything special for the error token. */
+
+#if 0
+  /* This is wrong; only states that explicitly want error tokens
+     should shift them.  */
+  yyn = yydefact[yystate];  /* If its default is to accept any token, ok.  Otherwise pop it.*/
+  if (yyn) goto yydefault;
+#endif
+
+yyerrpop:   /* pop the current state because it cannot handle the error token */
+
+  if (yyssp == yyss) YYABORT;
+  yyvsp--;
+  yystate = *--yyssp;
+#ifdef YYLSP_NEEDED
+  yylsp--;
+#endif
+
+#if YYDEBUG != 0
+  if (yydebug)
+    {
+      short *ssp1 = yyss - 1;
+      fprintf (stderr, "Error: state stack now");
+      while (ssp1 != yyssp)
+	fprintf (stderr, " %d", *++ssp1);
+      fprintf (stderr, "\n");
+    }
+#endif
+
+yyerrhandle:
+
+  yyn = yypact[yystate];
+  if (yyn == YYFLAG)
+    goto yyerrdefault;
+
+  yyn += YYTERROR;
+  if (yyn < 0 || yyn > YYLAST || yycheck[yyn] != YYTERROR)
+    goto yyerrdefault;
+
+  yyn = yytable[yyn];
+  if (yyn < 0)
+    {
+      if (yyn == YYFLAG)
+	goto yyerrpop;
+      yyn = -yyn;
+      goto yyreduce;
+    }
+  else if (yyn == 0)
+    goto yyerrpop;
+
+  if (yyn == YYFINAL)
+    YYACCEPT;
+
+#if YYDEBUG != 0
+  if (yydebug)
+    fprintf(stderr, "Shifting error token, ");
+#endif
+
+  *++yyvsp = yylval;
+#ifdef YYLSP_NEEDED
+  *++yylsp = yylloc;
+#endif
+
+  yystate = yyn;
+  goto yynewstate;
+}

Engine/bin/flex/flex_1.html

@@ -0,0 +1,4079 @@
+<html><head><title>flex</title></head><body>
+<ul>
+</ul><H2>NAME </H2><ul>
+
+flex - fast lexical analyzer generator
+
+</ul><H2>SYNOPSIS </H2><ul>
+
+<b>flex</b> 
+<b>[-bcdfhilnpstvwBFILTV78+?</b> <b>-C[aefFmr]</b> <b>-ooutput</b> <b>-Pprefix</b> <b>-Sskeleton]</b> 
+<b>[--help</b> <b>--version]</b> 
+<i>[filename</i> <i>...]</i> 
+
+</ul><H2>OVERVIEW </H2><ul>
+
+This manual describes
+<i>flex,</i> 
+a tool for generating programs that perform pattern-matching on text.  The
+manual includes both tutorial and reference sections:
+<pre>
+
+<p><br>    Description
+<br>        a brief overview of the tool
+<br>
+<p><br>    Some Simple Examples
+<br>
+<p><br>    Format Of The Input File
+<br>
+<p><br>    Patterns
+<br>        the extended regular expressions used by flex
+<br>
+<p><br>    How The Input Is Matched
+<br>        the rules for determining what has been matched
+<br>
+<p><br>    Actions
+<br>        how to specify what to do when a pattern is matched
+<br>
+<p><br>    The Generated Scanner
+<br>        details regarding the scanner that flex produces;
+<br>        how to control the input source
+<br>
+<p><br>    Start Conditions
+<br>        introducing context into your scanners, and
+<br>        managing "mini-scanners"
+<br>
+<p><br>    Multiple Input Buffers
+<br>        how to manipulate multiple input sources; how to
+<br>        scan from strings instead of files
+<br>
+<p><br>    End-of-file Rules
+<br>        special rules for matching the end of the input
+<br>
+<p><br>    Miscellaneous Macros
+<br>        a summary of macros available to the actions
+<br>
+<p><br>    Values Available To The User
+<br>        a summary of values available to the actions
+<br>
+<p><br>    Interfacing With Yacc
+<br>        connecting flex scanners together with yacc parsers
+<br>
+<p><br>    Options
+<br>        flex command-line options, and the "%option"
+<br>        directive
+<br>
+<p><br>    Performance Considerations
+<br>        how to make your scanner go as fast as possible
+<br>
+<p><br>    Generating C++ Scanners
+<br>        the (experimental) facility for generating C++
+<br>        scanner classes
+<br>
+<p><br>    Incompatibilities With Lex And POSIX
+<br>        how flex differs from AT&amp;T lex and the POSIX lex
+<br>        standard
+<br>
+<p><br>    Diagnostics
+<br>        those error messages produced by flex (or scanners
+<br>        it generates) whose meanings might not be apparent
+<br>
+<p><br>    Files
+<br>        files used by flex
+<br>
+<p><br>    Deficiencies / Bugs
+<br>        known problems with flex
+<br>
+<p><br>    See Also
+<br>        other documentation, related tools
+<br>
+<p><br>    Author
+<br>        includes contact information
+<br>
+<p><br></pre>
+
+</ul><H2>DESCRIPTION </H2><ul>
+
+<i>flex</i> 
+is a tool for generating
+<i>scanners:</i> 
+programs which recognized lexical patterns in text.
+<i>flex</i> 
+reads
+the given input files, or its standard input if no file names are given,
+for a description of a scanner to generate.  The description is in
+the form of pairs
+of regular expressions and C code, called
+<i>rules.</i> <i>flex</i> 
+generates as output a C source file,
+<b>lex.yy.c,</b> 
+which defines a routine
+<b>yylex().</b> 
+This file is compiled and linked with the
+<b>-lfl</b> 
+library to produce an executable.  When the executable is run,
+it analyzes its input for occurrences
+of the regular expressions.  Whenever it finds one, it executes
+the corresponding C code.
+
+</ul><H2>SOME SIMPLE EXAMPLES </H2><ul>
+
+
+<p>
+First some simple examples to get the flavor of how one uses
+<i>flex.</i> 
+The following
+<i>flex</i> 
+input specifies a scanner which whenever it encounters the string
+"username" will replace it with the user's login name:
+<pre>
+
+<p><br>    %%
+<br>    username    printf( "%s", getlogin() );
+<br>
+<p><br></pre>
+By default, any text not matched by a
+<i>flex</i> 
+scanner
+is copied to the output, so the net effect of this scanner is
+to copy its input file to its output with each occurrence
+of "username" expanded.
+In this input, there is just one rule.  "username" is the
+<i>pattern</i> 
+and the "printf" is the
+<i>action.</i> 
+The "%%" marks the beginning of the rules.
+
+<p>
+Here's another simple example:
+<pre>
+
+<p><br>            int num_lines = 0, num_chars = 0;
+<br>
+<p><br>    %%
+<br>    \n      ++num_lines; ++num_chars;
+<br>    .       ++num_chars;
+<br>
+<p><br>    %%
+<br>    main()
+<br>            {
+<br>            yylex();
+<br>            printf( "# of lines = %d, # of chars = %d\n",
+<br>                    num_lines, num_chars );
+<br>            }
+<br>
+<p><br></pre>
+This scanner counts the number of characters and the number
+of lines in its input (it produces no output other than the
+final report on the counts).  The first line
+declares two globals, "num_lines" and "num_chars", which are accessible
+both inside
+<b>yylex()</b> 
+and in the
+<b>main()</b> 
+routine declared after the second "%%".  There are two rules, one
+which matches a newline ("\n") and increments both the line count and
+the character count, and one which matches any character other than
+a newline (indicated by the "." regular expression).
+
+<p>
+A somewhat more complicated example:
+<pre>
+
+<p><br>    /* scanner for a toy Pascal-like language */
+<br>
+<p><br>    %{
+<br>    /* need this for the call to atof() below */
+<br>    #include &lt;math.h&gt;
+<br>    %}
+<br>
+<p><br>    DIGIT    [0-9]
+<br>    ID       [a-z][a-z0-9]*
+<br>
+<p><br>    %%
+<br>
+<p><br>    {DIGIT}+    {
+<br>                printf( "An integer: %s (%d)\n", yytext,
+<br>                        atoi( yytext ) );
+<br>                }
+<br>
+<p><br>    {DIGIT}+"."{DIGIT}*        {
+<br>                printf( "A float: %s (%g)\n", yytext,
+<br>                        atof( yytext ) );
+<br>                }
+<br>
+<p><br>    if|then|begin|end|procedure|function        {
+<br>                printf( "A keyword: %s\n", yytext );
+<br>                }
+<br>
+<p><br>    {ID}        printf( "An identifier: %s\n", yytext );
+<br>
+<p><br>    "+"|"-"|"*"|"/"   printf( "An operator: %s\n", yytext );
+<br>
+<p><br>    "{"[^}\n]*"}"     /* eat up one-line comments */
+<br>
+<p><br>    [ \t\n]+          /* eat up whitespace */
+<br>
+<p><br>    .           printf( "Unrecognized character: %s\n", yytext );
+<br>
+<p><br>    %%
+<br>
+<p><br>    main( argc, argv )
+<br>    int argc;
+<br>    char **argv;
+<br>        {
+<br>        ++argv, --argc;  /* skip over program name */
+<br>        if ( argc &gt; 0 )
+<br>                yyin = fopen( argv[0], "r" );
+<br>        else
+<br>                yyin = stdin;
+<br>        
+<br>        yylex();
+<br>        }
+<br>
+<p><br></pre>
+This is the beginnings of a simple scanner for a language like
+Pascal.  It identifies different types of
+<i>tokens</i> 
+and reports on what it has seen.
+
+<p>
+The details of this example will be explained in the following
+sections.
+
+</ul><H2>FORMAT OF THE INPUT FILE </H2><ul>
+
+The
+<i>flex</i> 
+input file consists of three sections, separated by a line with just
+<b>%%</b> 
+in it:
+<pre>
+
+<p><br>    definitions
+<br>    %%
+<br>    rules
+<br>    %%
+<br>    user code
+<br>
+<p><br></pre>
+The
+<i>definitions</i> 
+section contains declarations of simple
+<i>name</i> 
+definitions to simplify the scanner specification, and declarations of
+<i>start</i> <i>conditions,</i> 
+which are explained in a later section.
+
+<p>
+Name definitions have the form:
+<pre>
+
+<p><br>    name definition
+<br>
+<p><br></pre>
+The "name" is a word beginning with a letter or an underscore ('_')
+followed by zero or more letters, digits, '_', or '-' (dash).
+The definition is taken to begin at the first non-white-space character
+following the name and continuing to the end of the line.
+The definition can subsequently be referred to using "{name}", which
+will expand to "(definition)".  For example,
+<pre>
+
+<p><br>    DIGIT    [0-9]
+<br>    ID       [a-z][a-z0-9]*
+<br>
+<p><br></pre>
+defines "DIGIT" to be a regular expression which matches a
+single digit, and
+"ID" to be a regular expression which matches a letter
+followed by zero-or-more letters-or-digits.
+A subsequent reference to
+<pre>
+
+<p><br>    {DIGIT}+"."{DIGIT}*
+<br>
+<p><br></pre>
+is identical to
+<pre>
+
+<p><br>    ([0-9])+"."([0-9])*
+<br>
+<p><br></pre>
+and matches one-or-more digits followed by a '.' followed
+by zero-or-more digits.
+
+<p>
+The
+<i>rules</i> 
+section of the
+<i>flex</i> 
+input contains a series of rules of the form:
+<pre>
+
+<p><br>    pattern   action
+<br>
+<p><br></pre>
+where the pattern must be unindented and the action must begin
+on the same line.
+
+<p>
+See below for a further description of patterns and actions.
+
+<p>
+Finally, the user code section is simply copied to
+<b>lex.yy.c</b> 
+verbatim.
+It is used for companion routines which call or are called
+by the scanner.  The presence of this section is optional;
+if it is missing, the second
+<b>%%</b> 
+in the input file may be skipped, too.
+
+<p>
+In the definitions and rules sections, any
+<i>indented</i> 
+text or text enclosed in
+<b>%{</b> 
+and
+<b>%}</b> 
+is copied verbatim to the output (with the %{}'s removed).
+The %{}'s must appear unindented on lines by themselves.
+
+<p>
+In the rules section,
+any indented or %{} text appearing before the
+first rule may be used to declare variables
+which are local to the scanning routine and (after the declarations)
+code which is to be executed whenever the scanning routine is entered.
+Other indented or %{} text in the rule section is still copied to the output,
+but its meaning is not well-defined and it may well cause compile-time
+errors (this feature is present for
+<i>POSIX</i> 
+compliance; see below for other such features).
+
+<p>
+In the definitions section (but not in the rules section),
+an unindented comment (i.e., a line
+beginning with "/*") is also copied verbatim to the output up
+to the next "*/".
+
+</ul><H2>PATTERNS </H2><ul>
+
+The patterns in the input are written using an extended set of regular
+expressions.  These are:
+<pre>
+
+<p><br>    x          match the character 'x'
+<br>    .          any character (byte) except newline
+<br>    [xyz]      a "character class"; in this case, the pattern
+<br>                 matches either an 'x', a 'y', or a 'z'
+<br>    [abj-oZ]   a "character class" with a range in it; matches
+<br>                 an 'a', a 'b', any letter from 'j' through 'o',
+<br>                 or a 'Z'
+<br>    [^A-Z]     a "negated character class", i.e., any character
+<br>                 but those in the class.  In this case, any
+<br>                 character EXCEPT an uppercase letter.
+<br>    [^A-Z\n]   any character EXCEPT an uppercase letter or
+<br>                 a newline
+<br>    r*         zero or more r's, where r is any regular expression
+<br>    r+         one or more r's
+<br>    r?         zero or one r's (that is, "an optional r")
+<br>    r{2,5}     anywhere from two to five r's
+<br>    r{2,}      two or more r's
+<br>    r{4}       exactly 4 r's
+<br>    {name}     the expansion of the "name" definition
+<br>               (see above)
+<br>    "[xyz]\"foo"
+<br>               the literal string: [xyz]"foo
+<br>    \X         if X is an 'a', 'b', 'f', 'n', 'r', 't', or 'v',
+<br>                 then the ANSI-C interpretation of \x.
+<br>                 Otherwise, a literal 'X' (used to escape
+<br>                 operators such as '*')
+<br>    \0         a NUL character (ASCII code 0)
+<br>    \123       the character with octal value 123
+<br>    \x2a       the character with hexadecimal value 2a
+<br>    (r)        match an r; parentheses are used to override
+<br>                 precedence (see below)
+<br>
+<p><br>
+<p><br>    rs         the regular expression r followed by the
+<br>                 regular expression s; called "concatenation"
+<br>
+<p><br>
+<p><br>    r|s        either an r or an s
+<br>
+<p><br>
+<p><br>    r/s        an r but only if it is followed by an s.  The
+<br>                 text matched by s is included when determining
+<br>                 whether this rule is the "longest match",
+<br>                 but is then returned to the input before
+<br>                 the action is executed.  So the action only
+<br>                 sees the text matched by r.  This type
+<br>                 of pattern is called trailing context".
+<br>                 (There are some combinations of r/s that flex
+<br>                 cannot match correctly; see notes in the
+<br>                 Deficiencies / Bugs section below regarding
+<br>                 "dangerous trailing context".)
+<br>    ^r         an r, but only at the beginning of a line (i.e.,
+<br>                 which just starting to scan, or right after a
+<br>                 newline has been scanned).
+<br>    r$         an r, but only at the end of a line (i.e., just
+<br>                 before a newline).  Equivalent to "r/\n".
+<br>
+<p><br>               Note that flex's notion of "newline" is exactly
+<br>               whatever the C compiler used to compile flex
+<br>               interprets '\n' as; in particular, on some DOS
+<br>               systems you must either filter out \r's in the
+<br>               input yourself, or explicitly use r/\r\n for "r$".
+<br>
+<p><br>
+<p><br>    &lt;s&gt;r       an r, but only in start condition s (see
+<br>                 below for discussion of start conditions)
+<br>    &lt;s1,s2,s3&gt;r
+<br>               same, but in any of start conditions s1,
+<br>                 s2, or s3
+<br>    &lt;*&gt;r       an r in any start condition, even an exclusive one.
+<br>
+<p><br>
+<p><br>    &lt;&lt;EOF&gt;&gt;    an end-of-file
+<br>    &lt;s1,s2&gt;&lt;&lt;EOF&gt;&gt;
+<br>               an end-of-file when in start condition s1 or s2
+<br>
+<p><br></pre>
+Note that inside of a character class, all regular expression operators
+lose their special meaning except escape ('\') and the character class
+operators, '-', ']', and, at the beginning of the class, '^'.
+
+<p>
+The regular expressions listed above are grouped according to
+precedence, from highest precedence at the top to lowest at the bottom.
+Those grouped together have equal precedence.  For example,
+<pre>
+
+<p><br>    foo|bar*
+<br>
+<p><br></pre>
+is the same as
+<pre>
+
+<p><br>    (foo)|(ba(r*))
+<br>
+<p><br></pre>
+since the '*' operator has higher precedence than concatenation,
+and concatenation higher than alternation ('|').  This pattern
+therefore matches
+<i>either</i> 
+the string "foo"
+<i>or</i> 
+the string "ba" followed by zero-or-more r's.
+To match "foo" or zero-or-more "bar"'s, use:
+<pre>
+
+<p><br>    foo|(bar)*
+<br>
+<p><br></pre>
+and to match zero-or-more "foo"'s-or-"bar"'s:
+<pre>
+
+<p><br>    (foo|bar)*
+<br>
+<p><br></pre>
+
+<p>
+In addition to characters and ranges of characters, character classes
+can also contain character class
+<i>expressions.</i> 
+These are expressions enclosed inside
+<b>[:</b> 
+and
+<b>:]</b> 
+delimiters (which themselves must appear between the '[' and ']' of the
+character class; other elements may occur inside the character class, too).
+The valid expressions are:
+<pre>
+
+<p><br>    [:alnum:] [:alpha:] [:blank:]
+<br>    [:cntrl:] [:digit:] [:graph:]
+<br>    [:lower:] [:print:] [:punct:]
+<br>    [:space:] [:upper:] [:xdigit:]
+<br>
+<p><br></pre>
+These expressions all designate a set of characters equivalent to
+the corresponding standard C
+<b>isXXX</b> 
+function.  For example,
+<b>[:alnum:]</b> 
+designates those characters for which
+<b>isalnum()</b> 
+returns true - i.e., any alphabetic or numeric.
+Some systems don't provide
+<b>isblank(),</b> 
+so flex defines
+<b>[:blank:]</b> 
+as a blank or a tab.
+
+<p>
+For example, the following character classes are all equivalent:
+<pre>
+
+<p><br>    [[:alnum:]]
+<br>    [[:alpha:][:digit:]
+<br>    [[:alpha:]0-9]
+<br>    [a-zA-Z0-9]
+<br>
+<p><br></pre>
+If your scanner is case-insensitive (the
+<b>-i</b> 
+flag), then
+<b>[:upper:]</b> 
+and
+<b>[:lower:]</b> 
+are equivalent to
+<b>[:alpha:].</b> 
+
+<p>
+Some notes on patterns:
+<p><dl compact><dt>-<dd>A negated character class such as the example "[^A-Z]"
+above
+<i>will</i> <i>match</i> <i>a</i> <i>newline</i> 
+unless "\n" (or an equivalent escape sequence) is one of the
+characters explicitly present in the negated character class
+(e.g., "[^A-Z\n]").  This is unlike how many other regular
+expression tools treat negated character classes, but unfortunately
+the inconsistency is historically entrenched.
+Matching newlines means that a pattern like [^"]* can match the entire
+input unless there's another quote in the input.
+<dt>-<dd>A rule can have at most one instance of trailing context (the '/' operator
+or the '$' operator).  The start condition, '^', and "&lt;&lt;EOF&gt;&gt;" patterns
+can only occur at the beginning of a pattern, and, as well as with '/' and '$',
+cannot be grouped inside parentheses.  A '^' which does not occur at
+the beginning of a rule or a '$' which does not occur at the end of
+a rule loses its special properties and is treated as a normal character.
+<dt><dd>The following are illegal:
+<pre>
+
+<p><br>    foo/bar$
+<br>    &lt;sc1&gt;foo&lt;sc2&gt;bar
+<br>
+<p><br></pre>
+Note that the first of these, can be written "foo/bar\n".
+<dt><dd>The following will result in '$' or '^' being treated as a normal character:
+<pre>
+
+<p><br>    foo|(bar$)
+<br>    foo|^bar
+<br>
+<p><br></pre>
+If what's wanted is a "foo" or a bar-followed-by-a-newline, the following
+could be used (the special '|' action is explained below):
+<pre>
+
+<p><br>    foo      |
+<br>    bar$     /* action goes here */
+<br>
+<p><br></pre>
+A similar trick will work for matching a foo or a
+bar-at-the-beginning-of-a-line.
+</dl>
+</ul><H2>HOW THE INPUT IS MATCHED </H2><ul>
+
+When the generated scanner is run, it analyzes its input looking
+for strings which match any of its patterns.  If it finds more than
+one match, it takes the one matching the most text (for trailing
+context rules, this includes the length of the trailing part, even
+though it will then be returned to the input).  If it finds two
+or more matches of the same length, the
+rule listed first in the
+<i>flex</i> 
+input file is chosen.
+
+<p>
+Once the match is determined, the text corresponding to the match
+(called the
+<i>token)</i> 
+is made available in the global character pointer
+<b>yytext,</b> 
+and its length in the global integer
+<b>yyleng.</b> 
+The
+<i>action</i> 
+corresponding to the matched pattern is then executed (a more
+detailed description of actions follows), and then the remaining
+input is scanned for another match.
+
+<p>
+If no match is found, then the
+<i>default</i> <i>rule</i> 
+is executed: the next character in the input is considered matched and
+copied to the standard output.  Thus, the simplest legal
+<i>flex</i> 
+input is:
+<pre>
+
+<p><br>    %%
+<br>
+<p><br></pre>
+which generates a scanner that simply copies its input (one character
+at a time) to its output.
+
+<p>
+Note that
+<b>yytext</b> 
+can be defined in two different ways: either as a character
+<i>pointer</i> 
+or as a character
+<i>array.</i> 
+You can control which definition
+<i>flex</i> 
+uses by including one of the special directives
+<b>%pointer</b> 
+or
+<b>%array</b> 
+in the first (definitions) section of your flex input.  The default is
+<b>%pointer,</b> 
+unless you use the
+<b>-l</b> 
+lex compatibility option, in which case
+<b>yytext</b> 
+will be an array.
+The advantage of using
+<b>%pointer</b> 
+is substantially faster scanning and no buffer overflow when matching
+very large tokens (unless you run out of dynamic memory).  The disadvantage
+is that you are restricted in how your actions can modify
+<b>yytext</b> 
+(see the next section), and calls to the
+<b>unput()</b> 
+function destroys the present contents of
+<b>yytext,</b> 
+which can be a considerable porting headache when moving between different
+<i>lex</i> 
+versions.
+
+<p>
+The advantage of
+<b>%array</b> 
+is that you can then modify
+<b>yytext</b> 
+to your heart's content, and calls to
+<b>unput()</b> 
+do not destroy
+<b>yytext</b> 
+(see below).  Furthermore, existing
+<i>lex</i> 
+programs sometimes access
+<b>yytext</b> 
+externally using declarations of the form:
+<pre>
+    extern char yytext[];
+<br></pre>
+This definition is erroneous when used with
+<b>%pointer,</b> 
+but correct for
+<b>%array.</b> 
+
+<p>
+<b>%array</b> 
+defines
+<b>yytext</b> 
+to be an array of
+<b>YYLMAX</b> 
+characters, which defaults to a fairly large value.  You can change
+the size by simply #define'ing
+<b>YYLMAX</b> 
+to a different value in the first section of your
+<i>flex</i> 
+input.  As mentioned above, with
+<b>%pointer</b> 
+yytext grows dynamically to accommodate large tokens.  While this means your
+<b>%pointer</b> 
+scanner can accommodate very large tokens (such as matching entire blocks
+of comments), bear in mind that each time the scanner must resize
+<b>yytext</b> 
+it also must rescan the entire token from the beginning, so matching such
+tokens can prove slow.
+<b>yytext</b> 
+presently does
+<i>not</i> 
+dynamically grow if a call to
+<b>unput()</b> 
+results in too much text being pushed back; instead, a run-time error results.
+
+<p>
+Also note that you cannot use
+<b>%array</b> 
+with C++ scanner classes
+(the
+<b>c++</b> 
+option; see below).
+
+</ul><H2>ACTIONS </H2><ul>
+
+Each pattern in a rule has a corresponding action, which can be any
+arbitrary C statement.  The pattern ends at the first non-escaped
+whitespace character; the remainder of the line is its action.  If the
+action is empty, then when the pattern is matched the input token
+is simply discarded.  For example, here is the specification for a program
+which deletes all occurrences of "zap me" from its input:
+<pre>
+
+<p><br>    %%
+<br>    "zap me"
+<br>
+<p><br></pre>
+(It will copy all other characters in the input to the output since
+they will be matched by the default rule.)
+
+<p>
+Here is a program which compresses multiple blanks and tabs down to
+a single blank, and throws away whitespace found at the end of a line:
+<pre>
+
+<p><br>    %%
+<br>    [ \t]+        putchar( ' ' );
+<br>    [ \t]+$       /* ignore this token */
+<br>
+<p><br></pre>
+
+<p>
+If the action contains a '{', then the action spans till the balancing '}'
+is found, and the action may cross multiple lines.
+<i>flex</i> 
+knows about C strings and comments and won't be fooled by braces found
+within them, but also allows actions to begin with
+<b>%{</b> 
+and will consider the action to be all the text up to the next
+<b>%}</b> 
+(regardless of ordinary braces inside the action).
+
+<p>
+An action consisting solely of a vertical bar ('|') means "same as
+the action for the next rule."  See below for an illustration.
+
+<p>
+Actions can include arbitrary C code, including
+<b>return</b> 
+statements to return a value to whatever routine called
+<b>yylex().</b> 
+Each time
+<b>yylex()</b> 
+is called it continues processing tokens from where it last left
+off until it either reaches
+the end of the file or executes a return.
+
+<p>
+Actions are free to modify
+<b>yytext</b> 
+except for lengthening it (adding
+characters to its end--these will overwrite later characters in the
+input stream).  This however does not apply when using
+<b>%array</b> 
+(see above); in that case,
+<b>yytext</b> 
+may be freely modified in any way.
+
+<p>
+Actions are free to modify
+<b>yyleng</b> 
+except they should not do so if the action also includes use of
+<b>yymore()</b> 
+(see below).
+
+<p>
+There are a number of special directives which can be included within
+an action:
+<p><dl compact><dt>-<dd><b>ECHO</b> 
+copies yytext to the scanner's output.
+<dt>-<dd><b>BEGIN</b> 
+followed by the name of a start condition places the scanner in the
+corresponding start condition (see below).
+<dt>-<dd><b>REJECT</b> 
+directs the scanner to proceed on to the "second best" rule which matched the
+input (or a prefix of the input).  The rule is chosen as described
+above in "How the Input is Matched", and
+<b>yytext</b> 
+and
+<b>yyleng</b> 
+set up appropriately.
+It may either be one which matched as much text
+as the originally chosen rule but came later in the
+<i>flex</i> 
+input file, or one which matched less text.
+For example, the following will both count the
+words in the input and call the routine special() whenever "frob" is seen:
+<pre>
+
+<p><br>            int word_count = 0;
+<br>    %%
+<br>
+<p><br>    frob        special(); REJECT;
+<br>    [^ \t\n]+   ++word_count;
+<br>
+<p><br></pre>
+Without the
+<b>REJECT,</b> 
+any "frob"'s in the input would not be counted as words, since the
+scanner normally executes only one action per token.
+Multiple
+<b>REJECT's</b> 
+are allowed, each one finding the next best choice to the currently
+active rule.  For example, when the following scanner scans the token
+"abcd", it will write "abcdabcaba" to the output:
+<pre>
+
+<p><br>    %%
+<br>    a        |
+<br>    ab       |
+<br>    abc      |
+<br>    abcd     ECHO; REJECT;
+<br>    .|\n     /* eat up any unmatched character */
+<br>
+<p><br></pre>
+(The first three rules share the fourth's action since they use
+the special '|' action.)
+<b>REJECT</b> 
+is a particularly expensive feature in terms of scanner performance;
+if it is used in
+<i>any</i> 
+of the scanner's actions it will slow down
+<i>all</i> 
+of the scanner's matching.  Furthermore,
+<b>REJECT</b> 
+cannot be used with the
+<i>-Cf</i> 
+or
+<i>-CF</i> 
+options (see below).
+<dt><dd>Note also that unlike the other special actions,
+<b>REJECT</b> 
+is a
+<i>branch;</i> 
+code immediately following it in the action will
+<i>not</i> 
+be executed.
+<dt>-<dd><b>yymore()</b> 
+tells the scanner that the next time it matches a rule, the corresponding
+token should be
+<i>appended</i> 
+onto the current value of
+<b>yytext</b> 
+rather than replacing it.  For example, given the input "mega-kludge"
+the following will write "mega-mega-kludge" to the output:
+<pre>
+
+<p><br>    %%
+<br>    mega-    ECHO; yymore();
+<br>    kludge   ECHO;
+<br>
+<p><br></pre>
+First "mega-" is matched and echoed to the output.  Then "kludge"
+is matched, but the previous "mega-" is still hanging around at the
+beginning of
+<b>yytext</b> 
+so the
+<b>ECHO</b> 
+for the "kludge" rule will actually write "mega-kludge".
+</dl>
+<p>
+Two notes regarding use of
+<b>yymore().</b> 
+First,
+<b>yymore()</b> 
+depends on the value of
+<i>yyleng</i> 
+correctly reflecting the size of the current token, so you must not
+modify
+<i>yyleng</i> 
+if you are using
+<b>yymore().</b> 
+Second, the presence of
+<b>yymore()</b> 
+in the scanner's action entails a minor performance penalty in the
+scanner's matching speed.
+<p><dl compact><dt>-<dd><b>yyless(n)</b> 
+returns all but the first
+<i>n</i> 
+characters of the current token back to the input stream, where they
+will be rescanned when the scanner looks for the next match.
+<b>yytext</b> 
+and
+<b>yyleng</b> 
+are adjusted appropriately (e.g.,
+<b>yyleng</b> 
+will now be equal to
+<i>n</i> 
+).  For example, on the input "foobar" the following will write out
+"foobarbar":
+<pre>
+
+<p><br>    %%
+<br>    foobar    ECHO; yyless(3);
+<br>    [a-z]+    ECHO;
+<br>
+<p><br></pre>
+An argument of 0 to
+<b>yyless</b> 
+will cause the entire current input string to be scanned again.  Unless you've
+changed how the scanner will subsequently process its input (using
+<b>BEGIN,</b> 
+for example), this will result in an endless loop.
+</dl>
+<p>
+Note that
+<b>yyless</b> 
+is a macro and can only be used in the flex input file, not from
+other source files.
+<p><dl compact><dt>-<dd><b>unput(c)</b> 
+puts the character
+<i>c</i> 
+back onto the input stream.  It will be the next character scanned.
+The following action will take the current token and cause it
+to be rescanned enclosed in parentheses.
+<pre>
+
+<p><br>    {
+<br>    int i;
+<br>    /* Copy yytext because unput() trashes yytext */
+<br>    char *yycopy = strdup( yytext );
+<br>    unput( ')' );
+<br>    for ( i = yyleng - 1; i &gt;= 0; --i )
+<br>        unput( yycopy[i] );
+<br>    unput( '(' );
+<br>    free( yycopy );
+<br>    }
+<br>
+<p><br></pre>
+Note that since each
+<b>unput()</b> 
+puts the given character back at the
+<i>beginning</i> 
+of the input stream, pushing back strings must be done back-to-front.
+</dl>
+<p>
+An important potential problem when using
+<b>unput()</b> 
+is that if you are using
+<b>%pointer</b> 
+(the default), a call to
+<b>unput()</b> 
+<i>destroys</i> 
+the contents of
+<i>yytext,</i> 
+starting with its rightmost character and devouring one character to
+the left with each call.  If you need the value of yytext preserved
+after a call to
+<b>unput()</b> 
+(as in the above example),
+you must either first copy it elsewhere, or build your scanner using
+<b>%array</b> 
+instead (see How The Input Is Matched).
+
+<p>
+Finally, note that you cannot put back
+<b>EOF</b> 
+to attempt to mark the input stream with an end-of-file.
+<p><dl compact><dt>-<dd><b>input()</b> 
+reads the next character from the input stream.  For example,
+the following is one way to eat up C comments:
+<pre>
+
+<p><br>    %%
+<br>    "/*"        {
+<br>                register int c;
+<br>
+<p><br>                for ( ; ; )
+<br>                    {
+<br>                    while ( (c = input()) != '*' &amp;&amp;
+<br>                            c != EOF )
+<br>                        ;    /* eat up text of comment */
+<br>
+<p><br>                    if ( c == '*' )
+<br>                        {
+<br>                        while ( (c = input()) == '*' )
+<br>                            ;
+<br>                        if ( c == '/' )
+<br>                            break;    /* found the end */
+<br>                        }
+<br>
+<p><br>                    if ( c == EOF )
+<br>                        {
+<br>                        error( "EOF in comment" );
+<br>                        break;
+<br>                        }
+<br>                    }
+<br>                }
+<br>
+<p><br></pre>
+(Note that if the scanner is compiled using
+<b>C++,</b> 
+then
+<b>input()</b> 
+is instead referred to as
+<b>yyinput(),</b> 
+in order to avoid a name clash with the
+<b>C++</b> 
+stream by the name of
+<i>input.)</i> 
+<dt>-<dd><b>YY_FLUSH_BUFFER</b> 
+flushes the scanner's internal buffer
+so that the next time the scanner attempts to match a token, it will
+first refill the buffer using
+<b>YY_INPUT</b> 
+(see The Generated Scanner, below).  This action is a special case
+of the more general
+<b>yy_flush_buffer()</b> 
+function, described below in the section Multiple Input Buffers.
+<dt>-<dd><b>yyterminate()</b> 
+can be used in lieu of a return statement in an action.  It terminates
+the scanner and returns a 0 to the scanner's caller, indicating "all done".
+By default,
+<b>yyterminate()</b> 
+is also called when an end-of-file is encountered.  It is a macro and
+may be redefined.
+</dl>
+</ul><H2>THE GENERATED SCANNER </H2><ul>
+
+The output of
+<i>flex</i> 
+is the file
+<b>lex.yy.c,</b> 
+which contains the scanning routine
+<b>yylex(),</b> 
+a number of tables used by it for matching tokens, and a number
+of auxiliary routines and macros.  By default,
+<b>yylex()</b> 
+is declared as follows:
+<pre>
+
+<p><br>    int yylex()
+<br>        {
+<br>        ... various definitions and the actions in here ...
+<br>        }
+<br>
+<p><br></pre>
+(If your environment supports function prototypes, then it will
+be "int yylex( void )".)  This definition may be changed by defining
+the "YY_DECL" macro.  For example, you could use:
+<pre>
+
+<p><br>    #define YY_DECL float lexscan( a, b ) float a, b;
+<br>
+<p><br></pre>
+to give the scanning routine the name
+<i>lexscan,</i> 
+returning a float, and taking two floats as arguments.  Note that
+if you give arguments to the scanning routine using a
+K&amp;R-style/non-prototyped function declaration, you must terminate
+the definition with a semi-colon (;).
+
+<p>
+Whenever
+<b>yylex()</b> 
+is called, it scans tokens from the global input file
+<i>yyin</i> 
+(which defaults to stdin).  It continues until it either reaches
+an end-of-file (at which point it returns the value 0) or
+one of its actions executes a
+<i>return</i> 
+statement.
+
+<p>
+If the scanner reaches an end-of-file, subsequent calls are undefined
+unless either
+<i>yyin</i> 
+is pointed at a new input file (in which case scanning continues from
+that file), or
+<b>yyrestart()</b> 
+is called.
+<b>yyrestart()</b> 
+takes one argument, a
+<b>FILE</b> <b>*</b> 
+pointer (which can be nil, if you've set up
+<b>YY_INPUT</b> 
+to scan from a source other than
+<i>yyin),</i> 
+and initializes
+<i>yyin</i> 
+for scanning from that file.  Essentially there is no difference between
+just assigning
+<i>yyin</i> 
+to a new input file or using
+<b>yyrestart()</b> 
+to do so; the latter is available for compatibility with previous versions
+of
+<i>flex,</i> 
+and because it can be used to switch input files in the middle of scanning.
+It can also be used to throw away the current input buffer, by calling
+it with an argument of
+<i>yyin;</i> 
+but better is to use
+<b>YY_FLUSH_BUFFER</b> 
+(see above).
+Note that
+<b>yyrestart()</b> 
+does
+<i>not</i> 
+reset the start condition to
+<b>INITIAL</b> 
+(see Start Conditions, below).
+
+<p>
+If
+<b>yylex()</b> 
+stops scanning due to executing a
+<i>return</i> 
+statement in one of the actions, the scanner may then be called again and it
+will resume scanning where it left off.
+
+<p>
+By default (and for purposes of efficiency), the scanner uses
+block-reads rather than simple
+<i>getc()</i> 
+calls to read characters from
+<i>yyin.</i> 
+The nature of how it gets its input can be controlled by defining the
+<b>YY_INPUT</b> 
+macro.
+YY_INPUT's calling sequence is "YY_INPUT(buf,result,max_size)".  Its
+action is to place up to
+<i>max_size</i> 
+characters in the character array
+<i>buf</i> 
+and return in the integer variable
+<i>result</i> 
+either the
+number of characters read or the constant YY_NULL (0 on Unix systems)
+to indicate EOF.  The default YY_INPUT reads from the
+global file-pointer "yyin".
+
+<p>
+A sample definition of YY_INPUT (in the definitions
+section of the input file):
+<pre>
+
+<p><br>    %{
+<br>    #define YY_INPUT(buf,result,max_size) \
+<br>        { \
+<br>        int c = getchar(); \
+<br>        result = (c == EOF) ? YY_NULL : (buf[0] = c, 1); \
+<br>        }
+<br>    %}
+<br>
+<p><br></pre>
+This definition will change the input processing to occur
+one character at a time.
+
+<p>
+When the scanner receives an end-of-file indication from YY_INPUT,
+it then checks the
+<b>yywrap()</b> 
+function.  If
+<b>yywrap()</b> 
+returns false (zero), then it is assumed that the
+function has gone ahead and set up
+<i>yyin</i> 
+to point to another input file, and scanning continues.  If it returns
+true (non-zero), then the scanner terminates, returning 0 to its
+caller.  Note that in either case, the start condition remains unchanged;
+it does
+<i>not</i> 
+revert to
+<b>INITIAL.</b> 
+
+<p>
+If you do not supply your own version of
+<b>yywrap(),</b> 
+then you must either use
+<b>%option</b> <b>noyywrap</b> 
+(in which case the scanner behaves as though
+<b>yywrap()</b> 
+returned 1), or you must link with
+<b>-lfl</b> 
+to obtain the default version of the routine, which always returns 1.
+
+<p>
+Three routines are available for scanning from in-memory buffers rather
+than files:
+<b>yy_scan_string(),</b> <b>yy_scan_bytes(),</b> 
+and
+<b>yy_scan_buffer().</b> 
+See the discussion of them below in the section Multiple Input Buffers.
+
+<p>
+The scanner writes its
+<b>ECHO</b> 
+output to the
+<i>yyout</i> 
+global (default, stdout), which may be redefined by the user simply
+by assigning it to some other
+<b>FILE</b> 
+pointer.
+
+</ul><H2>START CONDITIONS </H2><ul>
+
+<i>flex</i> 
+provides a mechanism for conditionally activating rules.  Any rule
+whose pattern is prefixed with "&lt;sc&gt;" will only be active when
+the scanner is in the start condition named "sc".  For example,
+<pre>
+
+<p><br>    &lt;STRING&gt;[^"]*        { /* eat up the string body ... */
+<br>                ...
+<br>                }
+<br>
+<p><br></pre>
+will be active only when the scanner is in the "STRING" start
+condition, and
+<pre>
+
+<p><br>    &lt;INITIAL,STRING,QUOTE&gt;\.        { /* handle an escape ... */
+<br>                ...
+<br>                }
+<br>
+<p><br></pre>
+will be active only when the current start condition is
+either "INITIAL", "STRING", or "QUOTE".
+
+<p>
+Start conditions
+are declared in the definitions (first) section of the input
+using unindented lines beginning with either
+<b>%s</b> 
+or
+<b>%x</b> 
+followed by a list of names.
+The former declares
+<i>inclusive</i> 
+start conditions, the latter
+<i>exclusive</i> 
+start conditions.  A start condition is activated using the
+<b>BEGIN</b> 
+action.  Until the next
+<b>BEGIN</b> 
+action is executed, rules with the given start
+condition will be active and
+rules with other start conditions will be inactive.
+If the start condition is
+<i>inclusive,</i> 
+then rules with no start conditions at all will also be active.
+If it is
+<i>exclusive,</i> 
+then
+<i>only</i> 
+rules qualified with the start condition will be active.
+A set of rules contingent on the same exclusive start condition
+describe a scanner which is independent of any of the other rules in the
+<i>flex</i> 
+input.  Because of this,
+exclusive start conditions make it easy to specify "mini-scanners"
+which scan portions of the input that are syntactically different
+from the rest (e.g., comments).
+
+<p>
+If the distinction between inclusive and exclusive start conditions
+is still a little vague, here's a simple example illustrating the
+connection between the two.  The set of rules:
+<pre>
+
+<p><br>    %s example
+<br>    %%
+<br>
+<p><br>    &lt;example&gt;foo   do_something();
+<br>
+<p><br>    bar            something_else();
+<br>
+<p><br></pre>
+is equivalent to
+<pre>
+
+<p><br>    %x example
+<br>    %%
+<br>
+<p><br>    &lt;example&gt;foo   do_something();
+<br>
+<p><br>    &lt;INITIAL,example&gt;bar    something_else();
+<br>
+<p><br></pre>
+Without the
+<b>&lt;INITIAL,example&gt;</b> 
+qualifier, the
+<i>bar</i> 
+pattern in the second example wouldn't be active (i.e., couldn't match)
+when in start condition
+<b>example.</b> 
+If we just used
+<b>&lt;example&gt;</b> 
+to qualify
+<i>bar,</i> 
+though, then it would only be active in
+<b>example</b> 
+and not in
+<b>INITIAL,</b> 
+while in the first example it's active in both, because in the first
+example the
+<b>example</b> 
+startion condition is an
+<i>inclusive</i> 
+<b>(%s)</b> 
+start condition.
+
+<p>
+Also note that the special start-condition specifier
+<b>&lt;*&gt;</b> 
+matches every start condition.  Thus, the above example could also
+have been written;
+<pre>
+
+<p><br>    %x example
+<br>    %%
+<br>
+<p><br>    &lt;example&gt;foo   do_something();
+<br>
+<p><br>    &lt;*&gt;bar    something_else();
+<br>
+<p><br></pre>
+
+<p>
+The default rule (to
+<b>ECHO</b> 
+any unmatched character) remains active in start conditions.  It
+is equivalent to:
+<pre>
+
+<p><br>    &lt;*&gt;.|\n     ECHO;
+<br>
+<p><br></pre>
+
+<p>
+<b>BEGIN(0)</b> 
+returns to the original state where only the rules with
+no start conditions are active.  This state can also be
+referred to as the start-condition "INITIAL", so
+<b>BEGIN(INITIAL)</b> 
+is equivalent to
+<b>BEGIN(0).</b> 
+(The parentheses around the start condition name are not required but
+are considered good style.)
+
+<p>
+<b>BEGIN</b> 
+actions can also be given as indented code at the beginning
+of the rules section.  For example, the following will cause
+the scanner to enter the "SPECIAL" start condition whenever
+<b>yylex()</b> 
+is called and the global variable
+<i>enter_special</i> 
+is true:
+<pre>
+
+<p><br>            int enter_special;
+<br>
+<p><br>    %x SPECIAL
+<br>    %%
+<br>            if ( enter_special )
+<br>                BEGIN(SPECIAL);
+<br>
+<p><br>    &lt;SPECIAL&gt;blahblahblah
+<br>    ...more rules follow...
+<br>
+<p><br></pre>
+
+<p>
+To illustrate the uses of start conditions,
+here is a scanner which provides two different interpretations
+of a string like "123.456".  By default it will treat it as
+as three tokens, the integer "123", a dot ('.'), and the integer "456".
+But if the string is preceded earlier in the line by the string
+"expect-floats"
+it will treat it as a single token, the floating-point number
+123.456:
+<pre>
+
+<p><br>    %{
+<br>    #include &lt;math.h&gt;
+<br>    %}
+<br>    %s expect
+<br>
+<p><br>    %%
+<br>    expect-floats        BEGIN(expect);
+<br>
+<p><br>    &lt;expect&gt;[0-9]+"."[0-9]+      {
+<br>                printf( "found a float, = %f\n",
+<br>                        atof( yytext ) );
+<br>                }
+<br>    &lt;expect&gt;\n           {
+<br>                /* that's the end of the line, so
+<br>                 * we need another "expect-number"
+<br>                 * before we'll recognize any more
+<br>                 * numbers
+<br>                 */
+<br>                BEGIN(INITIAL);
+<br>                }
+<br>
+<p><br>    [0-9]+      {
+<br>                printf( "found an integer, = %d\n",
+<br>                        atoi( yytext ) );
+<br>                }
+<br>
+<p><br>    "."         printf( "found a dot\n" );
+<br>
+<p><br></pre>
+Here is a scanner which recognizes (and discards) C comments while
+maintaining a count of the current input line.
+<pre>
+
+<p><br>    %x comment
+<br>    %%
+<br>            int line_num = 1;
+<br>
+<p><br>    "/*"         BEGIN(comment);
+<br>
+<p><br>    &lt;comment&gt;[^*\n]*        /* eat anything that's not a '*' */
+<br>    &lt;comment&gt;"*"+[^*/\n]*   /* eat up '*'s not followed by '/'s */
+<br>    &lt;comment&gt;\n             ++line_num;
+<br>    &lt;comment&gt;"*"+"/"        BEGIN(INITIAL);
+<br>
+<p><br></pre>
+This scanner goes to a bit of trouble to match as much
+text as possible with each rule.  In general, when attempting to write
+a high-speed scanner try to match as much possible in each rule, as
+it's a big win.
+
+<p>
+Note that start-conditions names are really integer values and
+can be stored as such.  Thus, the above could be extended in the
+following fashion:
+<pre>
+
+<p><br>    %x comment foo
+<br>    %%
+<br>            int line_num = 1;
+<br>            int comment_caller;
+<br>
+<p><br>    "/*"         {
+<br>                 comment_caller = INITIAL;
+<br>                 BEGIN(comment);
+<br>                 }
+<br>
+<p><br>    ...
+<br>
+<p><br>    &lt;foo&gt;"/*"    {
+<br>                 comment_caller = foo;
+<br>                 BEGIN(comment);
+<br>                 }
+<br>
+<p><br>    &lt;comment&gt;[^*\n]*        /* eat anything that's not a '*' */
+<br>    &lt;comment&gt;"*"+[^*/\n]*   /* eat up '*'s not followed by '/'s */
+<br>    &lt;comment&gt;\n             ++line_num;
+<br>    &lt;comment&gt;"*"+"/"        BEGIN(comment_caller);
+<br>
+<p><br></pre>
+Furthermore, you can access the current start condition using
+the integer-valued
+<b>YY_START</b> 
+macro.  For example, the above assignments to
+<i>comment_caller</i> 
+could instead be written
+<pre>
+
+<p><br>    comment_caller = YY_START;
+<br>
+<p><br></pre>
+Flex provides
+<b>YYSTATE</b> 
+as an alias for
+<b>YY_START</b> 
+(since that is what's used by AT&amp;T
+<i>lex).</i> 
+
+<p>
+Note that start conditions do not have their own name-space; %s's and %x's
+declare names in the same fashion as #define's.
+
+<p>
+Finally, here's an example of how to match C-style quoted strings using
+exclusive start conditions, including expanded escape sequences (but
+not including checking for a string that's too long):
+<pre>
+
+<p><br>    %x str
+<br>
+<p><br>    %%
+<br>            char string_buf[MAX_STR_CONST];
+<br>            char *string_buf_ptr;
+<br>
+<p><br>
+<p><br>    \"      string_buf_ptr = string_buf; BEGIN(str);
+<br>
+<p><br>    &lt;str&gt;\"        { /* saw closing quote - all done */
+<br>            BEGIN(INITIAL);
+<br>            *string_buf_ptr = '\0';
+<br>            /* return string constant token type and
+<br>             * value to parser
+<br>             */
+<br>            }
+<br>
+<p><br>    &lt;str&gt;\n        {
+<br>            /* error - unterminated string constant */
+<br>            /* generate error message */
+<br>            }
+<br>
+<p><br>    &lt;str&gt;\\[0-7]{1,3} {
+<br>            /* octal escape sequence */
+<br>            int result;
+<br>
+<p><br>            (void) sscanf( yytext + 1, "%o", &amp;result );
+<br>
+<p><br>            if ( result &gt; 0xff )
+<br>                    /* error, constant is out-of-bounds */
+<br>
+<p><br>            *string_buf_ptr++ = result;
+<br>            }
+<br>
+<p><br>    &lt;str&gt;\\[0-9]+ {
+<br>            /* generate error - bad escape sequence; something
+<br>             * like '\48' or '\0777777'
+<br>             */
+<br>            }
+<br>
+<p><br>    &lt;str&gt;\\n  *string_buf_ptr++ = '\n';
+<br>    &lt;str&gt;\\t  *string_buf_ptr++ = '\t';
+<br>    &lt;str&gt;\\r  *string_buf_ptr++ = '\r';
+<br>    &lt;str&gt;\\b  *string_buf_ptr++ = '\b';
+<br>    &lt;str&gt;\\f  *string_buf_ptr++ = '\f';
+<br>
+<p><br>    &lt;str&gt;\\(.|\n)  *string_buf_ptr++ = yytext[1];
+<br>
+<p><br>    &lt;str&gt;[^\\\n\"]+        {
+<br>            char *yptr = yytext;
+<br>
+<p><br>            while ( *yptr )
+<br>                    *string_buf_ptr++ = *yptr++;
+<br>            }
+<br>
+<p><br></pre>
+
+<p>
+Often, such as in some of the examples above, you wind up writing a
+whole bunch of rules all preceded by the same start condition(s).  Flex
+makes this a little easier and cleaner by introducing a notion of
+start condition
+<i>scope.</i> 
+A start condition scope is begun with:
+<pre>
+
+<p><br>    &lt;SCs&gt;{
+<br>
+<p><br></pre>
+where
+<i>SCs</i> 
+is a list of one or more start conditions.  Inside the start condition
+scope, every rule automatically has the prefix
+<i>&lt;SCs&gt;</i> 
+applied to it, until a
+<i>'}'</i> 
+which matches the initial
+<i>'{'.</i> 
+So, for example,
+<pre>
+
+<p><br>    &lt;ESC&gt;{
+<br>        "\\n"   return '\n';
+<br>        "\\r"   return '\r';
+<br>        "\\f"   return '\f';
+<br>        "\\0"   return '\0';
+<br>    }
+<br>
+<p><br></pre>
+is equivalent to:
+<pre>
+
+<p><br>    &lt;ESC&gt;"\\n"  return '\n';
+<br>    &lt;ESC&gt;"\\r"  return '\r';
+<br>    &lt;ESC&gt;"\\f"  return '\f';
+<br>    &lt;ESC&gt;"\\0"  return '\0';
+<br>
+<p><br></pre>
+Start condition scopes may be nested.
+
+<p>
+Three routines are available for manipulating stacks of start conditions:
+<p><dl compact><dt><b>void</b> <b>yy_push_state(int</b> <b>new_state)</b> 
+<dd>pushes the current start condition onto the top of the start condition
+stack and switches to
+<i>new_state</i> 
+as though you had used
+<b>BEGIN</b> <b>new_state</b> 
+(recall that start condition names are also integers).
+<dt><b>void</b> <b>yy_pop_state()</b> 
+<dd>pops the top of the stack and switches to it via
+<b>BEGIN.</b> 
+<dt><b>int</b> <b>yy_top_state()</b> 
+<dd>returns the top of the stack without altering the stack's contents.
+</dl>
+<p>
+The start condition stack grows dynamically and so has no built-in
+size limitation.  If memory is exhausted, program execution aborts.
+
+<p>
+To use start condition stacks, your scanner must include a
+<b>%option</b> <b>stack</b> 
+directive (see Options below).
+
+</ul><H2>MULTIPLE INPUT BUFFERS </H2><ul>
+
+Some scanners (such as those which support "include" files)
+require reading from several input streams.  As
+<i>flex</i> 
+scanners do a large amount of buffering, one cannot control
+where the next input will be read from by simply writing a
+<b>YY_INPUT</b> 
+which is sensitive to the scanning context.
+<b>YY_INPUT</b> 
+is only called when the scanner reaches the end of its buffer, which
+may be a long time after scanning a statement such as an "include"
+which requires switching the input source.
+
+<p>
+To negotiate these sorts of problems,
+<i>flex</i> 
+provides a mechanism for creating and switching between multiple
+input buffers.  An input buffer is created by using:
+<pre>
+
+<p><br>    YY_BUFFER_STATE yy_create_buffer( FILE *file, int size )
+<br>
+<p><br></pre>
+which takes a
+<i>FILE</i> 
+pointer and a size and creates a buffer associated with the given
+file and large enough to hold
+<i>size</i> 
+characters (when in doubt, use
+<b>YY_BUF_SIZE</b> 
+for the size).  It returns a
+<b>YY_BUFFER_STATE</b> 
+handle, which may then be passed to other routines (see below).  The
+<b>YY_BUFFER_STATE</b> 
+type is a pointer to an opaque
+<b>struct</b> <b>yy_buffer_state</b> 
+structure, so you may safely initialize YY_BUFFER_STATE variables to
+<b>((YY_BUFFER_STATE)</b> <b>0)</b> 
+if you wish, and also refer to the opaque structure in order to
+correctly declare input buffers in source files other than that
+of your scanner.  Note that the
+<i>FILE</i> 
+pointer in the call to
+<b>yy_create_buffer</b> 
+is only used as the value of
+<i>yyin</i> 
+seen by
+<b>YY_INPUT;</b> 
+if you redefine
+<b>YY_INPUT</b> 
+so it no longer uses
+<i>yyin,</i> 
+then you can safely pass a nil
+<i>FILE</i> 
+pointer to
+<b>yy_create_buffer.</b> 
+You select a particular buffer to scan from using:
+<pre>
+
+<p><br>    void yy_switch_to_buffer( YY_BUFFER_STATE new_buffer )
+<br>
+<p><br></pre>
+switches the scanner's input buffer so subsequent tokens will
+come from
+<i>new_buffer.</i> 
+Note that
+<b>yy_switch_to_buffer()</b> 
+may be used by yywrap() to set things up for continued scanning, instead
+of opening a new file and pointing
+<i>yyin</i> 
+at it.  Note also that switching input sources via either
+<b>yy_switch_to_buffer()</b> 
+or
+<b>yywrap()</b> 
+does
+<i>not</i> 
+change the start condition.
+<pre>
+
+<p><br>    void yy_delete_buffer( YY_BUFFER_STATE buffer )
+<br>
+<p><br></pre>
+is used to reclaim the storage associated with a buffer.
+You can also clear the current contents of a buffer using:
+<pre>
+
+<p><br>    void yy_flush_buffer( YY_BUFFER_STATE buffer )
+<br>
+<p><br></pre>
+This function discards the buffer's contents,
+so the next time the scanner attempts to match a token from the
+buffer, it will first fill the buffer anew using
+<b>YY_INPUT.</b> 
+
+<p>
+<b>yy_new_buffer()</b> 
+is an alias for
+<b>yy_create_buffer(),</b> 
+provided for compatibility with the C++ use of
+<i>new</i> 
+and
+<i>delete</i> 
+for creating and destroying dynamic objects.
+
+<p>
+Finally, the
+<b>YY_CURRENT_BUFFER</b> 
+macro returns a
+<b>YY_BUFFER_STATE</b> 
+handle to the current buffer.
+
+<p>
+Here is an example of using these features for writing a scanner
+which expands include files (the
+<b>&lt;&lt;EOF&gt;&gt;</b> 
+feature is discussed below):
+<pre>
+
+<p><br>    /* the "incl" state is used for picking up the name
+<br>     * of an include file
+<br>     */
+<br>    %x incl
+<br>
+<p><br>    %{
+<br>    #define MAX_INCLUDE_DEPTH 10
+<br>    YY_BUFFER_STATE include_stack[MAX_INCLUDE_DEPTH];
+<br>    int include_stack_ptr = 0;
+<br>    %}
+<br>
+<p><br>    %%
+<br>    include             BEGIN(incl);
+<br>
+<p><br>    [a-z]+              ECHO;
+<br>    [^a-z\n]*\n?        ECHO;
+<br>
+<p><br>    &lt;incl&gt;[ \t]*      /* eat the whitespace */
+<br>    &lt;incl&gt;[^ \t\n]+   { /* got the include file name */
+<br>            if ( include_stack_ptr &gt;= MAX_INCLUDE_DEPTH )
+<br>                {
+<br>                fprintf( stderr, "Includes nested too deeply" );
+<br>                exit( 1 );
+<br>                }
+<br>
+<p><br>            include_stack[include_stack_ptr++] =
+<br>                YY_CURRENT_BUFFER;
+<br>
+<p><br>            yyin = fopen( yytext, "r" );
+<br>
+<p><br>            if ( ! yyin )
+<br>                error( ... );
+<br>
+<p><br>            yy_switch_to_buffer(
+<br>                yy_create_buffer( yyin, YY_BUF_SIZE ) );
+<br>
+<p><br>            BEGIN(INITIAL);
+<br>            }
+<br>
+<p><br>    &lt;&lt;EOF&gt;&gt; {
+<br>            if ( --include_stack_ptr &lt; 0 )
+<br>                {
+<br>                yyterminate();
+<br>                }
+<br>
+<p><br>            else
+<br>                {
+<br>                yy_delete_buffer( YY_CURRENT_BUFFER );
+<br>                yy_switch_to_buffer(
+<br>                     include_stack[include_stack_ptr] );
+<br>                }
+<br>            }
+<br>
+<p><br></pre>
+Three routines are available for setting up input buffers for
+scanning in-memory strings instead of files.  All of them create
+a new input buffer for scanning the string, and return a corresponding
+<b>YY_BUFFER_STATE</b> 
+handle (which you should delete with
+<b>yy_delete_buffer()</b> 
+when done with it).  They also switch to the new buffer using
+<b>yy_switch_to_buffer(),</b> 
+so the next call to
+<b>yylex()</b> 
+will start scanning the string.
+<p><dl compact><dt><b>yy_scan_string(const</b> <b>char</b> <b>*str)</b> 
+<dd>scans a NUL-terminated string.
+<dt><b>yy_scan_bytes(const</b> <b>char</b> <b>*bytes,</b> <b>int</b> <b>len)</b> 
+<dd>scans
+<i>len</i> 
+bytes (including possibly NUL's)
+starting at location
+<i>bytes.</i> 
+</dl>
+<p>
+Note that both of these functions create and scan a
+<i>copy</i> 
+of the string or bytes.  (This may be desirable, since
+<b>yylex()</b> 
+modifies the contents of the buffer it is scanning.)  You can avoid the
+copy by using:
+<p><dl compact><dt><b>yy_scan_buffer(char</b> <b>*base,</b> <b>yy_size_t</b> <b>size)</b> 
+<dd>which scans in place the buffer starting at
+<i>base,</i> 
+consisting of
+<i>size</i> 
+bytes, the last two bytes of which
+<i>must</i> 
+be
+<b>YY_END_OF_BUFFER_CHAR</b> 
+(ASCII NUL).
+These last two bytes are not scanned; thus, scanning
+consists of
+<b>base[0]</b> 
+through
+<b>base[size-2],</b> 
+inclusive.
+<dt><dd>If you fail to set up
+<i>base</i> 
+in this manner (i.e., forget the final two
+<b>YY_END_OF_BUFFER_CHAR</b> 
+bytes), then
+<b>yy_scan_buffer()</b> 
+returns a nil pointer instead of creating a new input buffer.
+<dt><dd>The type
+<b>yy_size_t</b> 
+is an integral type to which you can cast an integer expression
+reflecting the size of the buffer.
+</dl>
+</ul><H2>END-OF-FILE RULES </H2><ul>
+
+The special rule "&lt;&lt;EOF&gt;&gt;" indicates
+actions which are to be taken when an end-of-file is
+encountered and yywrap() returns non-zero (i.e., indicates
+no further files to process).  The action must finish
+by doing one of four things:
+<p><dl compact><dt>-<dd>assigning
+<i>yyin</i> 
+to a new input file (in previous versions of flex, after doing the
+assignment you had to call the special action
+<b>YY_NEW_FILE;</b> 
+this is no longer necessary);
+<dt>-<dd>executing a
+<i>return</i> 
+statement;
+<dt>-<dd>executing the special
+<b>yyterminate()</b> 
+action;
+<dt>-<dd>or, switching to a new buffer using
+<b>yy_switch_to_buffer()</b> 
+as shown in the example above.
+</dl>
+<p>
+&lt;&lt;EOF&gt;&gt; rules may not be used with other
+patterns; they may only be qualified with a list of start
+conditions.  If an unqualified &lt;&lt;EOF&gt;&gt; rule is given, it
+applies to
+<i>all</i> 
+start conditions which do not already have &lt;&lt;EOF&gt;&gt; actions.  To
+specify an &lt;&lt;EOF&gt;&gt; rule for only the initial start condition, use
+<pre>
+
+<p><br>    &lt;INITIAL&gt;&lt;&lt;EOF&gt;&gt;
+<br>
+<p><br></pre>
+
+<p>
+These rules are useful for catching things like unclosed comments.
+An example:
+<pre>
+
+<p><br>    %x quote
+<br>    %%
+<br>
+<p><br>    ...other rules for dealing with quotes...
+<br>
+<p><br>    &lt;quote&gt;&lt;&lt;EOF&gt;&gt;   {
+<br>             error( "unterminated quote" );
+<br>             yyterminate();
+<br>             }
+<br>    &lt;&lt;EOF&gt;&gt;  {
+<br>             if ( *++filelist )
+<br>                 yyin = fopen( *filelist, "r" );
+<br>             else
+<br>                yyterminate();
+<br>             }
+<br>
+<p><br></pre>
+
+</ul><H2>MISCELLANEOUS MACROS </H2><ul>
+
+The macro
+<b>YY_USER_ACTION</b> 
+can be defined to provide an action
+which is always executed prior to the matched rule's action.  For example,
+it could be #define'd to call a routine to convert yytext to lower-case.
+When
+<b>YY_USER_ACTION</b> 
+is invoked, the variable
+<i>yy_act</i> 
+gives the number of the matched rule (rules are numbered starting with 1).
+Suppose you want to profile how often each of your rules is matched.  The
+following would do the trick:
+<pre>
+
+<p><br>    #define YY_USER_ACTION ++ctr[yy_act]
+<br>
+<p><br></pre>
+where
+<i>ctr</i> 
+is an array to hold the counts for the different rules.  Note that
+the macro
+<b>YY_NUM_RULES</b> 
+gives the total number of rules (including the default rule, even if
+you use
+<b>-s),</b> 
+so a correct declaration for
+<i>ctr</i> 
+is:
+<pre>
+
+<p><br>    int ctr[YY_NUM_RULES];
+<br>
+<p><br></pre>
+
+<p>
+The macro
+<b>YY_USER_INIT</b> 
+may be defined to provide an action which is always executed before
+the first scan (and before the scanner's internal initializations are done).
+For example, it could be used to call a routine to read
+in a data table or open a logging file.
+
+<p>
+The macro
+<b>yy_set_interactive(is_interactive)</b> 
+can be used to control whether the current buffer is considered
+<i>interactive.</i> 
+An interactive buffer is processed more slowly,
+but must be used when the scanner's input source is indeed
+interactive to avoid problems due to waiting to fill buffers
+(see the discussion of the
+<b>-I</b> 
+flag below).  A non-zero value
+in the macro invocation marks the buffer as interactive, a zero  
+value as non-interactive.  Note that use of this macro overrides
+<b>%option</b> <b>always-interactive</b> 
+or
+<b>%option</b> <b>never-interactive</b> 
+(see Options below).
+<b>yy_set_interactive()</b> 
+must be invoked prior to beginning to scan the buffer that is
+(or is not) to be considered interactive.
+
+<p>
+The macro
+<b>yy_set_bol(at_bol)</b> 
+can be used to control whether the current buffer's scanning
+context for the next token match is done as though at the
+beginning of a line.  A non-zero macro argument makes rules anchored with
+'^' active, while a zero argument makes '^' rules inactive.
+
+<p>
+The macro
+<b>YY_AT_BOL()</b> 
+returns true if the next token scanned from the current buffer
+will have '^' rules active, false otherwise.
+
+<p>
+In the generated scanner, the actions are all gathered in one large
+switch statement and separated using
+<b>YY_BREAK,</b> 
+which may be redefined.  By default, it is simply a "break", to separate
+each rule's action from the following rule's.
+Redefining
+<b>YY_BREAK</b> 
+allows, for example, C++ users to
+#define YY_BREAK to do nothing (while being very careful that every
+rule ends with a "break" or a "return"!) to avoid suffering from
+unreachable statement warnings where because a rule's action ends with
+"return", the
+<b>YY_BREAK</b> 
+is inaccessible.
+
+</ul><H2>VALUES AVAILABLE TO THE USER </H2><ul>
+
+This section summarizes the various values available to the user
+in the rule actions.
+<p><dl compact><dt>-<dd><b>char</b> <b>*yytext</b> 
+holds the text of the current token.  It may be modified but not lengthened
+(you cannot append characters to the end).
+<dt><dd>If the special directive
+<b>%array</b> 
+appears in the first section of the scanner description, then
+<b>yytext</b> 
+is instead declared
+<b>char</b> <b>yytext[YYLMAX],</b> 
+where
+<b>YYLMAX</b> 
+is a macro definition that you can redefine in the first section
+if you don't like the default value (generally 8KB).  Using
+<b>%array</b> 
+results in somewhat slower scanners, but the value of
+<b>yytext</b> 
+becomes immune to calls to
+<i>input()</i> 
+and
+<i>unput(),</i> 
+which potentially destroy its value when
+<b>yytext</b> 
+is a character pointer.  The opposite of
+<b>%array</b> 
+is
+<b>%pointer,</b> 
+which is the default.
+<dt><dd>You cannot use
+<b>%array</b> 
+when generating C++ scanner classes
+(the
+<b>-+</b> 
+flag).
+<dt>-<dd><b>int</b> <b>yyleng</b> 
+holds the length of the current token.
+<dt>-<dd><b>FILE</b> <b>*yyin</b> 
+is the file which by default
+<i>flex</i> 
+reads from.  It may be redefined but doing so only makes sense before
+scanning begins or after an EOF has been encountered.  Changing it in
+the midst of scanning will have unexpected results since
+<i>flex</i> 
+buffers its input; use
+<b>yyrestart()</b> 
+instead.
+Once scanning terminates because an end-of-file
+has been seen, you can assign
+<i>yyin</i> 
+at the new input file and then call the scanner again to continue scanning.
+<dt>-<dd><b>void</b> <b>yyrestart(</b> <b>FILE</b> <b>*new_file</b> <b>)</b> 
+may be called to point
+<i>yyin</i> 
+at the new input file.  The switch-over to the new file is immediate
+(any previously buffered-up input is lost).  Note that calling
+<b>yyrestart()</b> 
+with
+<i>yyin</i> 
+as an argument thus throws away the current input buffer and continues
+scanning the same input file.
+<dt>-<dd><b>FILE</b> <b>*yyout</b> 
+is the file to which
+<b>ECHO</b> 
+actions are done.  It can be reassigned by the user.
+<dt>-<dd><b>YY_CURRENT_BUFFER</b> 
+returns a
+<b>YY_BUFFER_STATE</b> 
+handle to the current buffer.
+<dt>-<dd><b>YY_START</b> 
+returns an integer value corresponding to the current start
+condition.  You can subsequently use this value with
+<b>BEGIN</b> 
+to return to that start condition.
+</dl>
+</ul><H2>INTERFACING WITH YACC </H2><ul>
+
+One of the main uses of
+<i>flex</i> 
+is as a companion to the
+<i>yacc</i> 
+parser-generator.
+<i>yacc</i> 
+parsers expect to call a routine named
+<b>yylex()</b> 
+to find the next input token.  The routine is supposed to
+return the type of the next token as well as putting any associated
+value in the global
+<b>yylval.</b> 
+To use
+<i>flex</i> 
+with
+<i>yacc,</i> 
+one specifies the
+<b>-d</b> 
+option to
+<i>yacc</i> 
+to instruct it to generate the file
+<b>y.tab.h</b> 
+containing definitions of all the
+<b>%tokens</b> 
+appearing in the
+<i>yacc</i> 
+input.  This file is then included in the
+<i>flex</i> 
+scanner.  For example, if one of the tokens is "TOK_NUMBER",
+part of the scanner might look like:
+<pre>
+
+<p><br>    %{
+<br>    #include "y.tab.h"
+<br>    %}
+<br>
+<p><br>    %%
+<br>
+<p><br>    [0-9]+        yylval = atoi( yytext ); return TOK_NUMBER;
+<br>
+<p><br></pre>
+
+</ul><H2>OPTIONS </H2><ul>
+
+<i>flex</i> 
+has the following options:
+<p><dl compact><dt><b>-b</b> 
+<dd>Generate backing-up information to
+<i>lex.backup.</i> 
+This is a list of scanner states which require backing up
+and the input characters on which they do so.  By adding rules one
+can remove backing-up states.  If
+<i>all</i> 
+backing-up states are eliminated and
+<b>-Cf</b> 
+or
+<b>-CF</b> 
+is used, the generated scanner will run faster (see the
+<b>-p</b> 
+flag).  Only users who wish to squeeze every last cycle out of their
+scanners need worry about this option.  (See the section on Performance
+Considerations below.)
+<dt><b>-c</b> 
+<dd>is a do-nothing, deprecated option included for POSIX compliance.
+<dt><b>-d</b> 
+<dd>makes the generated scanner run in
+<i>debug</i> 
+mode.  Whenever a pattern is recognized and the global
+<b>yy_flex_debug</b> 
+is non-zero (which is the default),
+the scanner will write to
+<i>stderr</i> 
+a line of the form:
+<pre>
+
+<p><br>    --accepting rule at line 53 ("the matched text")
+<br>
+<p><br></pre>
+The line number refers to the location of the rule in the file
+defining the scanner (i.e., the file that was fed to flex).  Messages
+are also generated when the scanner backs up, accepts the
+default rule, reaches the end of its input buffer (or encounters
+a NUL; at this point, the two look the same as far as the scanner's concerned),
+or reaches an end-of-file.
+<dt><b>-f</b> 
+<dd>specifies
+<i>fast</i> <i>scanner.</i> 
+No table compression is done and stdio is bypassed.
+The result is large but fast.  This option is equivalent to
+<b>-Cfr</b> 
+(see below).
+<dt><b>-h</b> 
+<dd>generates a "help" summary of
+<i>flex's</i> 
+options to
+<i>stdout</i> 
+and then exits.
+<b>-?</b> 
+and
+<b>--help</b> 
+are synonyms for
+<b>-h.</b> 
+<dt><b>-i</b> 
+<dd>instructs
+<i>flex</i> 
+to generate a
+<i>case-insensitive</i> 
+scanner.  The case of letters given in the
+<i>flex</i> 
+input patterns will
+be ignored, and tokens in the input will be matched regardless of case.  The
+matched text given in
+<i>yytext</i> 
+will have the preserved case (i.e., it will not be folded).
+<dt><b>-l</b> 
+<dd>turns on maximum compatibility with the original AT&amp;T
+<i>lex</i> 
+implementation.  Note that this does not mean
+<i>full</i> 
+compatibility.  Use of this option costs a considerable amount of
+performance, and it cannot be used with the
+<b>-+,</b> <b>-f,</b> <b>-F,</b> <b>-Cf,</b> 
+or
+<b>-CF</b> 
+options.  For details on the compatibilities it provides, see the section
+"Incompatibilities With Lex And POSIX" below.  This option also results
+in the name
+<b>YY_FLEX_LEX_COMPAT</b> 
+being #define'd in the generated scanner.
+<dt><b>-n</b> 
+<dd>is another do-nothing, deprecated option included only for
+POSIX compliance.
+<dt><b>-p</b> 
+<dd>generates a performance report to stderr.  The report
+consists of comments regarding features of the
+<i>flex</i> 
+input file which will cause a serious loss of performance in the resulting
+scanner.  If you give the flag twice, you will also get comments regarding
+features that lead to minor performance losses.
+<dt><dd>Note that the use of
+<b>REJECT,</b> 
+<b>%option</b> <b>yylineno,</b> 
+and variable trailing context (see the Deficiencies / Bugs section below)
+entails a substantial performance penalty; use of
+<i>yymore(),</i> 
+the
+<b>^</b> 
+operator,
+and the
+<b>-I</b> 
+flag entail minor performance penalties.
+<dt><b>-s</b> 
+<dd>causes the
+<i>default</i> <i>rule</i> 
+(that unmatched scanner input is echoed to
+<i>stdout)</i> 
+to be suppressed.  If the scanner encounters input that does not
+match any of its rules, it aborts with an error.  This option is
+useful for finding holes in a scanner's rule set.
+<dt><b>-t</b> 
+<dd>instructs
+<i>flex</i> 
+to write the scanner it generates to standard output instead
+of
+<b>lex.yy.c.</b> 
+<dt><b>-v</b> 
+<dd>specifies that
+<i>flex</i> 
+should write to
+<i>stderr</i> 
+a summary of statistics regarding the scanner it generates.
+Most of the statistics are meaningless to the casual
+<i>flex</i> 
+user, but the first line identifies the version of
+<i>flex</i> 
+(same as reported by
+<b>-V),</b> 
+and the next line the flags used when generating the scanner, including
+those that are on by default.
+<dt><b>-w</b> 
+<dd>suppresses warning messages.
+<dt><b>-B</b> 
+<dd>instructs
+<i>flex</i> 
+to generate a
+<i>batch</i> 
+scanner, the opposite of
+<i>interactive</i> 
+scanners generated by
+<b>-I</b> 
+(see below).  In general, you use
+<b>-B</b> 
+when you are
+<i>certain</i> 
+that your scanner will never be used interactively, and you want to
+squeeze a
+<i>little</i> 
+more performance out of it.  If your goal is instead to squeeze out a
+<i>lot</i> 
+more performance, you should  be using the
+<b>-Cf</b> 
+or
+<b>-CF</b> 
+options (discussed below), which turn on
+<b>-B</b> 
+automatically anyway.
+<dt><b>-F</b> 
+<dd>specifies that the
+fast
+scanner table representation should be used (and stdio
+bypassed).  This representation is
+about as fast as the full table representation
+<b>(-f),</b> 
+and for some sets of patterns will be considerably smaller (and for
+others, larger).  In general, if the pattern set contains both "keywords"
+and a catch-all, "identifier" rule, such as in the set:
+<pre>
+
+<p><br>    "case"    return TOK_CASE;
+<br>    "switch"  return TOK_SWITCH;
+<br>    ...
+<br>    "default" return TOK_DEFAULT;
+<br>    [a-z]+    return TOK_ID;
+<br>
+<p><br></pre>
+then you're better off using the full table representation.  If only
+the "identifier" rule is present and you then use a hash table or some such
+to detect the keywords, you're better off using
+<b>-F.</b> 
+<dt><dd>This option is equivalent to
+<b>-CFr</b> 
+(see below).  It cannot be used with
+<b>-+.</b> 
+<dt><b>-I</b> 
+<dd>instructs
+<i>flex</i> 
+to generate an
+<i>interactive</i> 
+scanner.  An interactive scanner is one that only looks ahead to decide
+what token has been matched if it absolutely must.  It turns out that
+always looking one extra character ahead, even if the scanner has already
+seen enough text to disambiguate the current token, is a bit faster than
+only looking ahead when necessary.  But scanners that always look ahead
+give dreadful interactive performance; for example, when a user types
+a newline, it is not recognized as a newline token until they enter
+<i>another</i> 
+token, which often means typing in another whole line.
+<dt><dd><i>Flex</i> 
+scanners default to
+<i>interactive</i> 
+unless you use the
+<b>-Cf</b> 
+or
+<b>-CF</b> 
+table-compression options (see below).  That's because if you're looking
+for high-performance you should be using one of these options, so if you
+didn't,
+<i>flex</i> 
+assumes you'd rather trade off a bit of run-time performance for intuitive
+interactive behavior.  Note also that you
+<i>cannot</i> 
+use
+<b>-I</b> 
+in conjunction with
+<b>-Cf</b> 
+or
+<b>-CF.</b> 
+Thus, this option is not really needed; it is on by default for all those
+cases in which it is allowed.
+<dt><dd>You can force a scanner to
+<i>not</i> 
+be interactive by using
+<b>-B</b> 
+(see above).
+<dt><b>-L</b> 
+<dd>instructs
+<i>flex</i> 
+not to generate
+<b>#line</b> 
+directives.  Without this option,
+<i>flex</i> 
+peppers the generated scanner
+with #line directives so error messages in the actions will be correctly
+located with respect to either the original
+<i>flex</i> 
+input file (if the errors are due to code in the input file), or
+<b>lex.yy.c</b> 
+(if the errors are
+<i>flex's</i> 
+fault -- you should report these sorts of errors to the email address
+given below).
+<dt><b>-T</b> 
+<dd>makes
+<i>flex</i> 
+run in
+<i>trace</i> 
+mode.  It will generate a lot of messages to
+<i>stderr</i> 
+concerning
+the form of the input and the resultant non-deterministic and deterministic
+finite automata.  This option is mostly for use in maintaining
+<i>flex.</i> 
+<dt><b>-V</b> 
+<dd>prints the version number to
+<i>stdout</i> 
+and exits.
+<b>--version</b> 
+is a synonym for
+<b>-V.</b> 
+<dt><b>-7</b> 
+<dd>instructs
+<i>flex</i> 
+to generate a 7-bit scanner, i.e., one which can only recognized 7-bit
+characters in its input.  The advantage of using
+<b>-7</b> 
+is that the scanner's tables can be up to half the size of those generated
+using the
+<b>-8</b> 
+option (see below).  The disadvantage is that such scanners often hang
+or crash if their input contains an 8-bit character.
+<dt><dd>Note, however, that unless you generate your scanner using the
+<b>-Cf</b> 
+or
+<b>-CF</b> 
+table compression options, use of
+<b>-7</b> 
+will save only a small amount of table space, and make your scanner
+considerably less portable.
+<i>Flex's</i> 
+default behavior is to generate an 8-bit scanner unless you use the
+<b>-Cf</b> 
+or
+<b>-CF,</b> 
+in which case
+<i>flex</i> 
+defaults to generating 7-bit scanners unless your site was always
+configured to generate 8-bit scanners (as will often be the case
+with non-USA sites).  You can tell whether flex generated a 7-bit
+or an 8-bit scanner by inspecting the flag summary in the
+<b>-v</b> 
+output as described above.
+<dt><dd>Note that if you use
+<b>-Cfe</b> 
+or
+<b>-CFe</b> 
+(those table compression options, but also using equivalence classes as
+discussed see below), flex still defaults to generating an 8-bit
+scanner, since usually with these compression options full 8-bit tables
+are not much more expensive than 7-bit tables.
+<dt><b>-8</b> 
+<dd>instructs
+<i>flex</i> 
+to generate an 8-bit scanner, i.e., one which can recognize 8-bit
+characters.  This flag is only needed for scanners generated using
+<b>-Cf</b> 
+or
+<b>-CF,</b> 
+as otherwise flex defaults to generating an 8-bit scanner anyway.
+<dt><dd>See the discussion of
+<b>-7</b> 
+above for flex's default behavior and the tradeoffs between 7-bit
+and 8-bit scanners.
+<dt><b>-+</b> 
+<dd>specifies that you want flex to generate a C++
+scanner class.  See the section on Generating C++ Scanners below for
+details.
+<dt><b>-C[aefFmr]</b> 
+<dd>controls the degree of table compression and, more generally, trade-offs
+between small scanners and fast scanners.
+<dt><dd><b>-Ca</b> 
+("align") instructs flex to trade off larger tables in the
+generated scanner for faster performance because the elements of
+the tables are better aligned for memory access and computation.  On some
+RISC architectures, fetching and manipulating longwords is more efficient
+than with smaller-sized units such as shortwords.  This option can
+double the size of the tables used by your scanner.
+<dt><dd><b>-Ce</b> 
+directs
+<i>flex</i> 
+to construct
+<i>equivalence</i> <i>classes,</i> 
+i.e., sets of characters
+which have identical lexical properties (for example, if the only
+appearance of digits in the
+<i>flex</i> 
+input is in the character class
+"[0-9]" then the digits '0', '1', ..., '9' will all be put
+in the same equivalence class).  Equivalence classes usually give
+dramatic reductions in the final table/object file sizes (typically
+a factor of 2-5) and are pretty cheap performance-wise (one array
+look-up per character scanned).
+<dt><dd><b>-Cf</b> 
+specifies that the
+<i>full</i> 
+scanner tables should be generated -
+<i>flex</i> 
+should not compress the
+tables by taking advantages of similar transition functions for
+different states.
+<dt><dd><b>-CF</b> 
+specifies that the alternate fast scanner representation (described
+above under the
+<b>-F</b> 
+flag)
+should be used.  This option cannot be used with
+<b>-+.</b> 
+<dt><dd><b>-Cm</b> 
+directs
+<i>flex</i> 
+to construct
+<i>meta-equivalence</i> <i>classes,</i> 
+which are sets of equivalence classes (or characters, if equivalence
+classes are not being used) that are commonly used together.  Meta-equivalence
+classes are often a big win when using compressed tables, but they
+have a moderate performance impact (one or two "if" tests and one
+array look-up per character scanned).
+<dt><dd><b>-Cr</b> 
+causes the generated scanner to
+<i>bypass</i> 
+use of the standard I/O library (stdio) for input.  Instead of calling
+<b>fread()</b> 
+or
+<b>getc(),</b> 
+the scanner will use the
+<b>read()</b> 
+system call, resulting in a performance gain which varies from system
+to system, but in general is probably negligible unless you are also using
+<b>-Cf</b> 
+or
+<b>-CF.</b> 
+Using
+<b>-Cr</b> 
+can cause strange behavior if, for example, you read from
+<i>yyin</i> 
+using stdio prior to calling the scanner (because the scanner will miss
+whatever text your previous reads left in the stdio input buffer).
+<dt><dd><b>-Cr</b> 
+has no effect if you define
+<b>YY_INPUT</b> 
+(see The Generated Scanner above).
+<dt><dd>A lone
+<b>-C</b> 
+specifies that the scanner tables should be compressed but neither
+equivalence classes nor meta-equivalence classes should be used.
+<dt><dd>The options
+<b>-Cf</b> 
+or
+<b>-CF</b> 
+and
+<b>-Cm</b> 
+do not make sense together - there is no opportunity for meta-equivalence
+classes if the table is not being compressed.  Otherwise the options
+may be freely mixed, and are cumulative.
+<dt><dd>The default setting is
+<b>-Cem,</b> 
+which specifies that
+<i>flex</i> 
+should generate equivalence classes
+and meta-equivalence classes.  This setting provides the highest
+degree of table compression.  You can trade off
+faster-executing scanners at the cost of larger tables with
+the following generally being true:
+<pre>
+
+<p><br>    slowest &amp; smallest
+<br>          -Cem
+<br>          -Cm
+<br>          -Ce
+<br>          -C
+<br>          -C{f,F}e
+<br>          -C{f,F}
+<br>          -C{f,F}a
+<br>    fastest &amp; largest
+<br>
+<p><br></pre>
+Note that scanners with the smallest tables are usually generated and
+compiled the quickest, so
+during development you will usually want to use the default, maximal
+compression.
+<dt><dd><b>-Cfe</b> 
+is often a good compromise between speed and size for production
+scanners.
+<dt><b>-ooutput</b> 
+<dd>directs flex to write the scanner to the file
+<b>output</b> 
+instead of
+<b>lex.yy.c.</b> 
+If you combine
+<b>-o</b> 
+with the
+<b>-t</b> 
+option, then the scanner is written to
+<i>stdout</i> 
+but its
+<b>#line</b> 
+directives (see the
+<b>\-L</b> 
+option above) refer to the file
+<b>output.</b> 
+<dt><b>-Pprefix</b> 
+<dd>changes the default
+<i>yy</i> 
+prefix used by
+<i>flex</i> 
+for all globally-visible variable and function names to instead be
+<i>prefix.</i> 
+For example,
+<b>-Pfoo</b> 
+changes the name of
+<b>yytext</b> 
+to
+<b>footext.</b> 
+It also changes the name of the default output file from
+<b>lex.yy.c</b> 
+to
+<b>lex.foo.c.</b> 
+Here are all of the names affected:
+<pre>
+
+<p><br>    yy_create_buffer
+<br>    yy_delete_buffer
+<br>    yy_flex_debug
+<br>    yy_init_buffer
+<br>    yy_flush_buffer
+<br>    yy_load_buffer_state
+<br>    yy_switch_to_buffer
+<br>    yyin
+<br>    yyleng
+<br>    yylex
+<br>    yylineno
+<br>    yyout
+<br>    yyrestart
+<br>    yytext
+<br>    yywrap
+<br>
+<p><br></pre>
+(If you are using a C++ scanner, then only
+<b>yywrap</b> 
+and
+<b>yyFlexLexer</b> 
+are affected.)
+Within your scanner itself, you can still refer to the global variables
+and functions using either version of their name; but externally, they
+have the modified name.
+<dt><dd>This option lets you easily link together multiple
+<i>flex</i> 
+programs into the same executable.  Note, though, that using this
+option also renames
+<b>yywrap(),</b> 
+so you now
+<i>must</i> 
+either
+provide your own (appropriately-named) version of the routine for your
+scanner, or use
+<b>%option</b> <b>noyywrap,</b> 
+as linking with
+<b>-lfl</b> 
+no longer provides one for you by default.
+<dt><b>-Sskeleton_file</b> 
+<dd>overrides the default skeleton file from which
+<i>flex</i> 
+constructs its scanners.  You'll never need this option unless you are doing
+<i>flex</i> 
+maintenance or development.
+</dl>
+<p>
+<i>flex</i> 
+also provides a mechanism for controlling options within the
+scanner specification itself, rather than from the flex command-line.
+This is done by including
+<b>%option</b> 
+directives in the first section of the scanner specification.
+You can specify multiple options with a single
+<b>%option</b> 
+directive, and multiple directives in the first section of your flex input
+file.  Most
+options are given simply as names, optionally preceded by the
+word "no" (with no intervening whitespace) to negate their meaning.
+A number are equivalent to flex flags or their negation:
+<pre>
+
+<p><br>    7bit            -7 option
+<br>    8bit            -8 option
+<br>    align           -Ca option
+<br>    backup          -b option
+<br>    batch           -B option
+<br>    c++             -+ option
+<br>
+<p><br>    caseful or
+<br>    case-sensitive  opposite of -i (default)
+<br>
+<p><br>    case-insensitive or
+<br>    caseless        -i option
+<br>
+<p><br>    debug           -d option
+<br>    default         opposite of -s option
+<br>    ecs             -Ce option
+<br>    fast            -F option
+<br>    full            -f option
+<br>    interactive     -I option
+<br>    lex-compat      -l option
+<br>    meta-ecs        -Cm option
+<br>    perf-report     -p option
+<br>    read            -Cr option
+<br>    stdout          -t option
+<br>    verbose         -v option
+<br>    warn            opposite of -w option
+<br>                    (use "%option nowarn" for -w)
+<br>
+<p><br>    array           equivalent to "%array"
+<br>    pointer         equivalent to "%pointer" (default)
+<br>
+<p><br></pre>
+Some
+<b>%option's</b> 
+provide features otherwise not available:
+<p><dl compact><dt><b>always-interactive</b> 
+<dd>instructs flex to generate a scanner which always considers its input
+"interactive".  Normally, on each new input file the scanner calls
+<b>isatty()</b> 
+in an attempt to determine whether
+the scanner's input source is interactive and thus should be read a
+character at a time.  When this option is used, however, then no
+such call is made.
+<dt><b>main</b> 
+<dd>directs flex to provide a default
+<b>main()</b> 
+program for the scanner, which simply calls
+<b>yylex().</b> 
+This option implies
+<b>noyywrap</b> 
+(see below).
+<dt><b>never-interactive</b> 
+<dd>instructs flex to generate a scanner which never considers its input
+"interactive" (again, no call made to
+<b>isatty()).</b> 
+This is the opposite of
+<b>always-interactive.</b> 
+<dt><b>stack</b> 
+<dd>enables the use of start condition stacks (see Start Conditions above).
+<dt><b>stdinit</b> 
+<dd>if unset (i.e.,
+<b>%option</b> <b>nostdinit)</b> 
+initializes
+<i>yyin</i> 
+and
+<i>yyout</i> 
+to nil
+<i>FILE</i> 
+pointers, instead of
+<i>stdin</i> 
+and
+<i>stdout.</i> 
+<dt><b>yylineno</b> 
+<dd>directs
+<i>flex</i> 
+to generate a scanner that maintains the number of the current line
+read from its input in the global variable
+<b>yylineno.</b> 
+This option is implied by
+<b>%option</b> <b>lex-compat.</b> 
+<dt><b>yywrap</b> 
+<dd>if unset (i.e.,
+<b>%option</b> <b>noyywrap),</b> 
+makes the scanner not call
+<b>yywrap()</b> 
+upon an end-of-file, but simply assume that there are no more
+files to scan (until the user points
+<i>yyin</i> 
+at a new file and calls
+<b>yylex()</b> 
+again).
+</dl>
+<p>
+<i>flex</i> 
+scans your rule actions to determine whether you use the
+<b>REJECT</b> 
+or
+<b>yymore()</b> 
+features.  The
+<b>reject</b> 
+and
+<b>yymore</b> 
+options are available to override its decision as to whether you use the
+options, either by setting them (e.g.,
+<b>%option</b> <b>reject)</b> 
+to indicate the feature is indeed used, or
+unsetting them to indicate it actually is not used
+(e.g.,
+<b>%option</b> <b>noyymore).</b> 
+
+<p>
+Three options take string-delimited values, offset with '=':
+<pre>
+
+<p><br>    %option outfile="ABC"
+<br>
+<p><br></pre>
+is equivalent to
+<b>-oABC,</b> 
+and
+<pre>
+
+<p><br>    %option prefix="XYZ"
+<br>
+<p><br></pre>
+is equivalent to
+<b>-PXYZ.</b> 
+Finally,
+<pre>
+
+<p><br>    %option yyclass="foo"
+<br>
+<p><br></pre>
+only applies when generating a C++ scanner (
+<b>-+</b> 
+option).  It informs
+<i>flex</i> 
+that you have derived
+<b>foo</b> 
+as a subclass of
+<b>yyFlexLexer,</b> 
+so
+<i>flex</i> 
+will place your actions in the member function
+<b>foo::yylex()</b> 
+instead of
+<b>yyFlexLexer::yylex().</b> 
+It also generates a
+<b>yyFlexLexer::yylex()</b> 
+member function that emits a run-time error (by invoking
+<b>yyFlexLexer::LexerError())</b> 
+if called.
+See Generating C++ Scanners, below, for additional information.
+
+<p>
+A number of options are available for lint purists who want to suppress
+the appearance of unneeded routines in the generated scanner.  Each of the
+following, if unset, results in the corresponding routine not appearing in
+the generated scanner:
+<pre>
+
+<p><br>    input, unput
+<br>    yy_push_state, yy_pop_state, yy_top_state
+<br>    yy_scan_buffer, yy_scan_bytes, yy_scan_string
+<br>
+<p><br></pre>
+(though
+<b>yy_push_state()</b> 
+and friends won't appear anyway unless you use
+<b>%option</b> <b>stack).</b> 
+
+</ul><H2>PERFORMANCE CONSIDERATIONS </H2><ul>
+
+The main design goal of
+<i>flex</i> 
+is that it generate high-performance scanners.  It has been optimized
+for dealing well with large sets of rules.  Aside from the effects on
+scanner speed of the table compression
+<b>-C</b> 
+options outlined above,
+there are a number of options/actions which degrade performance.  These
+are, from most expensive to least:
+<pre>
+
+<p><br>    REJECT
+<br>    %option yylineno
+<br>    arbitrary trailing context
+<br>
+<p><br>    pattern sets that require backing up
+<br>    %array
+<br>    %option interactive
+<br>    %option always-interactive
+<br>
+<p><br>    '^' beginning-of-line operator
+<br>    yymore()
+<br>
+<p><br></pre>
+with the first three all being quite expensive and the last two
+being quite cheap.  Note also that
+<b>unput()</b> 
+is implemented as a routine call that potentially does quite a bit of
+work, while
+<b>yyless()</b> 
+is a quite-cheap macro; so if just putting back some excess text you
+scanned, use
+<b>yyless().</b> 
+
+<p>
+<b>REJECT</b> 
+should be avoided at all costs when performance is important.
+It is a particularly expensive option.
+
+<p>
+Getting rid of backing up is messy and often may be an enormous
+amount of work for a complicated scanner.  In principal, one begins
+by using the
+<b>-b</b> 
+flag to generate a
+<i>lex.backup</i> 
+file.  For example, on the input
+<pre>
+
+<p><br>    %%
+<br>    foo        return TOK_KEYWORD;
+<br>    foobar     return TOK_KEYWORD;
+<br>
+<p><br></pre>
+the file looks like:
+<pre>
+
+<p><br>    State #6 is non-accepting -
+<br>     associated rule line numbers:
+<br>           2       3
+<br>     out-transitions: [ o ]
+<br>     jam-transitions: EOF [ \001-n  p-\177 ]
+<br>
+<p><br>    State #8 is non-accepting -
+<br>     associated rule line numbers:
+<br>           3
+<br>     out-transitions: [ a ]
+<br>     jam-transitions: EOF [ \001-`  b-\177 ]
+<br>
+<p><br>    State #9 is non-accepting -
+<br>     associated rule line numbers:
+<br>           3
+<br>     out-transitions: [ r ]
+<br>     jam-transitions: EOF [ \001-q  s-\177 ]
+<br>
+<p><br>    Compressed tables always back up.
+<br>
+<p><br></pre>
+The first few lines tell us that there's a scanner state in
+which it can make a transition on an 'o' but not on any other
+character, and that in that state the currently scanned text does not match
+any rule.  The state occurs when trying to match the rules found
+at lines 2 and 3 in the input file.
+If the scanner is in that state and then reads
+something other than an 'o', it will have to back up to find
+a rule which is matched.  With
+a bit of headscratching one can see that this must be the
+state it's in when it has seen "fo".  When this has happened,
+if anything other than another 'o' is seen, the scanner will
+have to back up to simply match the 'f' (by the default rule).
+
+<p>
+The comment regarding State #8 indicates there's a problem
+when "foob" has been scanned.  Indeed, on any character other
+than an 'a', the scanner will have to back up to accept "foo".
+Similarly, the comment for State #9 concerns when "fooba" has
+been scanned and an 'r' does not follow.
+
+<p>
+The final comment reminds us that there's no point going to
+all the trouble of removing backing up from the rules unless
+we're using
+<b>-Cf</b> 
+or
+<b>-CF,</b> 
+since there's no performance gain doing so with compressed scanners.
+
+<p>
+The way to remove the backing up is to add "error" rules:
+<pre>
+
+<p><br>    %%
+<br>    foo         return TOK_KEYWORD;
+<br>    foobar      return TOK_KEYWORD;
+<br>
+<p><br>    fooba       |
+<br>    foob        |
+<br>    fo          {
+<br>                /* false alarm, not really a keyword */
+<br>                return TOK_ID;
+<br>                }
+<br>
+<p><br></pre>
+
+<p>
+Eliminating backing up among a list of keywords can also be
+done using a "catch-all" rule:
+<pre>
+
+<p><br>    %%
+<br>    foo         return TOK_KEYWORD;
+<br>    foobar      return TOK_KEYWORD;
+<br>
+<p><br>    [a-z]+      return TOK_ID;
+<br>
+<p><br></pre>
+This is usually the best solution when appropriate.
+
+<p>
+Backing up messages tend to cascade.
+With a complicated set of rules it's not uncommon to get hundreds
+of messages.  If one can decipher them, though, it often
+only takes a dozen or so rules to eliminate the backing up (though
+it's easy to make a mistake and have an error rule accidentally match
+a valid token.  A possible future
+<i>flex</i> 
+feature will be to automatically add rules to eliminate backing up).
+
+<p>
+It's important to keep in mind that you gain the benefits of eliminating
+backing up only if you eliminate
+<i>every</i> 
+instance of backing up.  Leaving just one means you gain nothing.
+
+<p>
+<i>Variable</i> 
+trailing context (where both the leading and trailing parts do not have
+a fixed length) entails almost the same performance loss as
+<b>REJECT</b> 
+(i.e., substantial).  So when possible a rule like:
+<pre>
+
+<p><br>    %%
+<br>    mouse|rat/(cat|dog)   run();
+<br>
+<p><br></pre>
+is better written:
+<pre>
+
+<p><br>    %%
+<br>    mouse/cat|dog         run();
+<br>    rat/cat|dog           run();
+<br>
+<p><br></pre>
+or as
+<pre>
+
+<p><br>    %%
+<br>    mouse|rat/cat         run();
+<br>    mouse|rat/dog         run();
+<br>
+<p><br></pre>
+Note that here the special '|' action does
+<i>not</i> 
+provide any savings, and can even make things worse (see
+Deficiencies / Bugs below).
+
+<p>
+Another area where the user can increase a scanner's performance
+(and one that's easier to implement) arises from the fact that
+the longer the tokens matched, the faster the scanner will run.
+This is because with long tokens the processing of most input
+characters takes place in the (short) inner scanning loop, and
+does not often have to go through the additional work of setting up
+the scanning environment (e.g.,
+<b>yytext)</b> 
+for the action.  Recall the scanner for C comments:
+<pre>
+
+<p><br>    %x comment
+<br>    %%
+<br>            int line_num = 1;
+<br>
+<p><br>    "/*"         BEGIN(comment);
+<br>
+<p><br>    &lt;comment&gt;[^*\n]*
+<br>    &lt;comment&gt;"*"+[^*/\n]*
+<br>    &lt;comment&gt;\n             ++line_num;
+<br>    &lt;comment&gt;"*"+"/"        BEGIN(INITIAL);
+<br>
+<p><br></pre>
+This could be sped up by writing it as:
+<pre>
+
+<p><br>    %x comment
+<br>    %%
+<br>            int line_num = 1;
+<br>
+<p><br>    "/*"         BEGIN(comment);
+<br>
+<p><br>    &lt;comment&gt;[^*\n]*
+<br>    &lt;comment&gt;[^*\n]*\n      ++line_num;
+<br>    &lt;comment&gt;"*"+[^*/\n]*
+<br>    &lt;comment&gt;"*"+[^*/\n]*\n ++line_num;
+<br>    &lt;comment&gt;"*"+"/"        BEGIN(INITIAL);
+<br>
+<p><br></pre>
+Now instead of each newline requiring the processing of another
+action, recognizing the newlines is "distributed" over the other rules
+to keep the matched text as long as possible.  Note that
+<i>adding</i> 
+rules does
+<i>not</i> 
+slow down the scanner!  The speed of the scanner is independent
+of the number of rules or (modulo the considerations given at the
+beginning of this section) how complicated the rules are with
+regard to operators such as '*' and '|'.
+
+<p>
+A final example in speeding up a scanner: suppose you want to scan
+through a file containing identifiers and keywords, one per line
+and with no other extraneous characters, and recognize all the
+keywords.  A natural first approach is:
+<pre>
+
+<p><br>    %%
+<br>    asm      |
+<br>    auto     |
+<br>    break    |
+<br>    ... etc ...
+<br>    volatile |
+<br>    while    /* it's a keyword */
+<br>
+<p><br>    .|\n     /* it's not a keyword */
+<br>
+<p><br></pre>
+To eliminate the back-tracking, introduce a catch-all rule:
+<pre>
+
+<p><br>    %%
+<br>    asm      |
+<br>    auto     |
+<br>    break    |
+<br>    ... etc ...
+<br>    volatile |
+<br>    while    /* it's a keyword */
+<br>
+<p><br>    [a-z]+   |
+<br>    .|\n     /* it's not a keyword */
+<br>
+<p><br></pre>
+Now, if it's guaranteed that there's exactly one word per line,
+then we can reduce the total number of matches by a half by
+merging in the recognition of newlines with that of the other
+tokens:
+<pre>
+
+<p><br>    %%
+<br>    asm\n    |
+<br>    auto\n   |
+<br>    break\n  |
+<br>    ... etc ...
+<br>    volatile\n |
+<br>    while\n  /* it's a keyword */
+<br>
+<p><br>    [a-z]+\n |
+<br>    .|\n     /* it's not a keyword */
+<br>
+<p><br></pre>
+One has to be careful here, as we have now reintroduced backing up
+into the scanner.  In particular, while
+<i>we</i> 
+know that there will never be any characters in the input stream
+other than letters or newlines,
+<i>flex</i> 
+can't figure this out, and it will plan for possibly needing to back up
+when it has scanned a token like "auto" and then the next character
+is something other than a newline or a letter.  Previously it would
+then just match the "auto" rule and be done, but now it has no "auto"
+rule, only a "auto\n" rule.  To eliminate the possibility of backing up,
+we could either duplicate all rules but without final newlines, or,
+since we never expect to encounter such an input and therefore don't
+how it's classified, we can introduce one more catch-all rule, this
+one which doesn't include a newline:
+<pre>
+
+<p><br>    %%
+<br>    asm\n    |
+<br>    auto\n   |
+<br>    break\n  |
+<br>    ... etc ...
+<br>    volatile\n |
+<br>    while\n  /* it's a keyword */
+<br>
+<p><br>    [a-z]+\n |
+<br>    [a-z]+   |
+<br>    .|\n     /* it's not a keyword */
+<br>
+<p><br></pre>
+Compiled with
+<b>-Cf,</b> 
+this is about as fast as one can get a
+<i>flex</i> 
+scanner to go for this particular problem.
+
+<p>
+A final note:
+<i>flex</i> 
+is slow when matching NUL's, particularly when a token contains
+multiple NUL's.
+It's best to write rules which match
+<i>short</i> 
+amounts of text if it's anticipated that the text will often include NUL's.
+
+<p>
+Another final note regarding performance: as mentioned above in the section
+How the Input is Matched, dynamically resizing
+<b>yytext</b> 
+to accommodate huge tokens is a slow process because it presently requires that
+the (huge) token be rescanned from the beginning.  Thus if performance is
+vital, you should attempt to match "large" quantities of text but not
+"huge" quantities, where the cutoff between the two is at about 8K
+characters/token.
+
+</ul><H2>GENERATING C++ SCANNERS </H2><ul>
+
+<i>flex</i> 
+provides two different ways to generate scanners for use with C++.  The
+first way is to simply compile a scanner generated by
+<i>flex</i> 
+using a C++ compiler instead of a C compiler.  You should not encounter
+any compilations errors (please report any you find to the email address
+given in the Author section below).  You can then use C++ code in your
+rule actions instead of C code.  Note that the default input source for
+your scanner remains
+<i>yyin,</i> 
+and default echoing is still done to
+<i>yyout.</i> 
+Both of these remain
+<i>FILE</i> <i>*</i> 
+variables and not C++
+<i>streams.</i> 
+
+<p>
+You can also use
+<i>flex</i> 
+to generate a C++ scanner class, using the
+<b>-+</b> 
+option (or, equivalently,
+<b>%option</b> <b>c++),</b> 
+which is automatically specified if the name of the flex
+executable ends in a '+', such as
+<i>flex++.</i> 
+When using this option, flex defaults to generating the scanner to the file
+<b>lex.yy.cc</b> 
+instead of
+<b>lex.yy.c.</b> 
+The generated scanner includes the header file
+<i>FlexLexer.h,</i> 
+which defines the interface to two C++ classes.
+
+<p>
+The first class,
+<b>FlexLexer,</b> 
+provides an abstract base class defining the general scanner class
+interface.  It provides the following member functions:
+<p><dl compact><dt><b>const</b> <b>char*</b> <b>YYText()</b> 
+<dd>returns the text of the most recently matched token, the equivalent of
+<b>yytext.</b> 
+<dt><b>int</b> <b>YYLeng()</b> 
+<dd>returns the length of the most recently matched token, the equivalent of
+<b>yyleng.</b> 
+<dt><b>int</b> <b>lineno()</b> <b>const</b> 
+<dd>returns the current input line number
+(see
+<b>%option</b> <b>yylineno),</b> 
+or
+<b>1</b> 
+if
+<b>%option</b> <b>yylineno</b> 
+was not used.
+<dt><b>void</b> <b>set_debug(</b> <b>int</b> <b>flag</b> <b>)</b> 
+<dd>sets the debugging flag for the scanner, equivalent to assigning to
+<b>yy_flex_debug</b> 
+(see the Options section above).  Note that you must build the scanner
+using
+<b>%option</b> <b>debug</b> 
+to include debugging information in it.
+<dt><b>int</b> <b>debug()</b> <b>const</b> 
+<dd>returns the current setting of the debugging flag.
+</dl>
+<p>
+Also provided are member functions equivalent to
+<b>yy_switch_to_buffer(),</b> 
+<b>yy_create_buffer()</b> 
+(though the first argument is an
+<b>istream*</b> 
+object pointer and not a
+<b>FILE*),</b> 
+<b>yy_flush_buffer(),</b> 
+<b>yy_delete_buffer(),</b> 
+and
+<b>yyrestart()</b> 
+(again, the first argument is a
+<b>istream*</b> 
+object pointer).
+
+<p>
+The second class defined in
+<i>FlexLexer.h</i> 
+is
+<b>yyFlexLexer,</b> 
+which is derived from
+<b>FlexLexer.</b> 
+It defines the following additional member functions:
+<p><dl compact><dt><b>yyFlexLexer( istream* arg_yyin = 0, ostream* arg_yyout = 0 )
+</b><dd>constructs a
+<b>yyFlexLexer</b> 
+object using the given streams for input and output.  If not specified,
+the streams default to
+<b>cin</b> 
+and
+<b>cout,</b> 
+respectively.
+<dt><b>virtual</b> <b>int</b> <b>yylex()</b> 
+<dd>performs the same role is
+<b>yylex()</b> 
+does for ordinary flex scanners: it scans the input stream, consuming
+tokens, until a rule's action returns a value.  If you derive a subclass
+<b>S</b> 
+from
+<b>yyFlexLexer</b> 
+and want to access the member functions and variables of
+<b>S</b> 
+inside
+<b>yylex(),</b> 
+then you need to use
+<b>%option</b> <b>yyclass=S</b> 
+to inform
+<i>flex</i> 
+that you will be using that subclass instead of
+<b>yyFlexLexer.</b> 
+In this case, rather than generating
+<b>yyFlexLexer::yylex(),</b> 
+<i>flex</i> 
+generates
+<b>S::yylex()</b> 
+(and also generates a dummy
+<b>yyFlexLexer::yylex()</b> 
+that calls
+<b>yyFlexLexer::LexerError()</b> 
+if called).
+<dt><b>virtual void switch_streams(istream* new_in = 0,
+</b><b><dd>ostream* new_out = 0)
+</b>reassigns
+<b>yyin</b> 
+to
+<b>new_in</b> 
+(if non-nil)
+and
+<b>yyout</b> 
+to
+<b>new_out</b> 
+(ditto), deleting the previous input buffer if
+<b>yyin</b> 
+is reassigned.
+<dt><b>int yylex( istream* new_in = 0, ostream* new_out = 0 )
+</b><dd>first switches the input streams via
+<b>switch_streams(</b> <b>new_in,</b> <b>new_out</b> <b>)</b> 
+and then returns the value of
+<b>yylex().</b> 
+</dl>
+<p>
+In addition,
+<b>yyFlexLexer</b> 
+defines the following protected virtual functions which you can redefine
+in derived classes to tailor the scanner:
+<p><dl compact><dt><b>virtual int LexerInput( char* buf, int max_size )
+</b><dd>reads up to
+<b>max_size</b> 
+characters into
+<b>buf</b> 
+and returns the number of characters read.  To indicate end-of-input,
+return 0 characters.  Note that "interactive" scanners (see the
+<b>-B</b> 
+and
+<b>-I</b> 
+flags) define the macro
+<b>YY_INTERACTIVE.</b> 
+If you redefine
+<b>LexerInput()</b> 
+and need to take different actions depending on whether or not
+the scanner might be scanning an interactive input source, you can
+test for the presence of this name via
+<b>#ifdef.</b> 
+<dt><b>virtual void LexerOutput( const char* buf, int size )
+</b><dd>writes out
+<b>size</b> 
+characters from the buffer
+<b>buf,</b> 
+which, while NUL-terminated, may also contain "internal" NUL's if
+the scanner's rules can match text with NUL's in them.
+<dt><b>virtual void LexerError( const char* msg )
+</b><dd>reports a fatal error message.  The default version of this function
+writes the message to the stream
+<b>cerr</b> 
+and exits.
+</dl>
+<p>
+Note that a
+<b>yyFlexLexer</b> 
+object contains its
+<i>entire</i> 
+scanning state.  Thus you can use such objects to create reentrant
+scanners.  You can instantiate multiple instances of the same
+<b>yyFlexLexer</b> 
+class, and you can also combine multiple C++ scanner classes together
+in the same program using the
+<b>-P</b> 
+option discussed above.
+
+<p>
+Finally, note that the
+<b>%array</b> 
+feature is not available to C++ scanner classes; you must use
+<b>%pointer</b> 
+(the default).
+
+<p>
+Here is an example of a simple C++ scanner:
+<pre>
+
+<p><br>        // An example of using the flex C++ scanner class.
+<br>
+<p><br>    %{
+<br>    int mylineno = 0;
+<br>    %}
+<br>
+<p><br>    string  \"[^\n"]+\"
+<br>
+<p><br>    ws      [ \t]+
+<br>
+<p><br>    alpha   [A-Za-z]
+<br>    dig     [0-9]
+<br>    name    ({alpha}|{dig}|\$)({alpha}|{dig}|[_.\-/$])*
+<br>    num1    [-+]?{dig}+\.?([eE][-+]?{dig}+)?
+<br>    num2    [-+]?{dig}*\.{dig}+([eE][-+]?{dig}+)?
+<br>    number  {num1}|{num2}
+<br>
+<p><br>    %%
+<br>
+<p><br>    {ws}    /* skip blanks and tabs */
+<br>
+<p><br>    "/*"    {
+<br>            int c;
+<br>
+<p><br>            while((c = yyinput()) != 0)
+<br>                {
+<br>                if(c == '\n')
+<br>                    ++mylineno;
+<br>
+<p><br>                else if(c == '*')
+<br>                    {
+<br>                    if((c = yyinput()) == '/')
+<br>                        break;
+<br>                    else
+<br>                        unput(c);
+<br>                    }
+<br>                }
+<br>            }
+<br>
+<p><br>    {number}  cout &lt;&lt; "number " &lt;&lt; YYText() &lt;&lt; '\n';
+<br>
+<p><br>    \n        mylineno++;
+<br>
+<p><br>    {name}    cout &lt;&lt; "name " &lt;&lt; YYText() &lt;&lt; '\n';
+<br>
+<p><br>    {string}  cout &lt;&lt; "string " &lt;&lt; YYText() &lt;&lt; '\n';
+<br>
+<p><br>    %%
+<br>
+<p><br>    int main( int /* argc */, char** /* argv */ )
+<br>        {
+<br>        FlexLexer* lexer = new yyFlexLexer;
+<br>        while(lexer-&gt;yylex() != 0)
+<br>            ;
+<br>        return 0;
+<br>        }
+<br></pre>
+If you want to create multiple (different) lexer classes, you use the
+<b>-P</b> 
+flag (or the
+<b>prefix=</b> 
+option) to rename each
+<b>yyFlexLexer</b> 
+to some other
+<b>xxFlexLexer.</b> 
+You then can include
+<b>&lt;FlexLexer.h&gt;</b> 
+in your other sources once per lexer class, first renaming
+<b>yyFlexLexer</b> 
+as follows:
+<pre>
+
+<p><br>    #undef yyFlexLexer
+<br>    #define yyFlexLexer xxFlexLexer
+<br>    #include &lt;FlexLexer.h&gt;
+<br>
+<p><br>    #undef yyFlexLexer
+<br>    #define yyFlexLexer zzFlexLexer
+<br>    #include &lt;FlexLexer.h&gt;
+<br>
+<p><br></pre>
+if, for example, you used
+<b>%option</b> <b>prefix=xx</b> 
+for one of your scanners and
+<b>%option</b> <b>prefix=zz</b> 
+for the other.
+
+<p>
+IMPORTANT: the present form of the scanning class is
+<i>experimental</i> 
+and may change considerably between major releases. 
+
+</ul><H2>INCOMPATIBILITIES WITH LEX AND POSIX </H2><ul>
+
+<i>flex</i> 
+is a rewrite of the AT&amp;T Unix
+<i>lex</i> 
+tool (the two implementations do not share any code, though),
+with some extensions and incompatibilities, both of which
+are of concern to those who wish to write scanners acceptable
+to either implementation.  Flex is fully compliant with the POSIX
+<i>lex</i> 
+specification, except that when using
+<b>%pointer</b> 
+(the default), a call to
+<b>unput()</b> 
+destroys the contents of
+<b>yytext,</b> 
+which is counter to the POSIX specification.
+
+<p>
+In this section we discuss all of the known areas of incompatibility
+between flex, AT&amp;T lex, and the POSIX specification.
+
+<p>
+<i>flex's</i> 
+<b>-l</b> 
+option turns on maximum compatibility with the original AT&amp;T
+<i>lex</i> 
+implementation, at the cost of a major loss in the generated scanner's
+performance.  We note below which incompatibilities can be overcome
+using the
+<b>-l</b> 
+option.
+
+<p>
+<i>flex</i> 
+is fully compatible with
+<i>lex</i> 
+with the following exceptions:
+<p><dl compact><dt>-<dd>The undocumented
+<i>lex</i> 
+scanner internal variable
+<b>yylineno</b> 
+is not supported unless
+<b>-l</b> 
+or
+<b>%option</b> <b>yylineno</b> 
+is used.
+<dt><dd><b>yylineno</b> 
+should be maintained on a per-buffer basis, rather than a per-scanner
+(single global variable) basis.
+<dt><dd><b>yylineno</b> 
+is not part of the POSIX specification.
+<dt>-<dd>The
+<b>input()</b> 
+routine is not redefinable, though it may be called to read characters
+following whatever has been matched by a rule.  If
+<b>input()</b> 
+encounters an end-of-file the normal
+<b>yywrap()</b> 
+processing is done.  A ``real'' end-of-file is returned by
+<b>input()</b> 
+as
+<i>EOF.</i> 
+<dt><dd>Input is instead controlled by defining the
+<b>YY_INPUT</b> 
+macro.
+<dt><dd>The
+<i>flex</i> 
+restriction that
+<b>input()</b> 
+cannot be redefined is in accordance with the POSIX specification,
+which simply does not specify any way of controlling the
+scanner's input other than by making an initial assignment to
+<i>yyin.</i> 
+<dt>-<dd>The
+<b>unput()</b> 
+routine is not redefinable.  This restriction is in accordance with POSIX.
+<dt>-<dd><i>flex</i> 
+scanners are not as reentrant as
+<i>lex</i> 
+scanners.  In particular, if you have an interactive scanner and
+an interrupt handler which long-jumps out of the scanner, and
+the scanner is subsequently called again, you may get the following
+message:
+<pre>
+
+<p><br>    fatal flex scanner internal error--end of buffer missed
+<br>
+<p><br></pre>
+To reenter the scanner, first use
+<pre>
+
+<p><br>    yyrestart( yyin );
+<br>
+<p><br></pre>
+Note that this call will throw away any buffered input; usually this
+isn't a problem with an interactive scanner.
+<dt><dd>Also note that flex C++ scanner classes
+<i>are</i> 
+reentrant, so if using C++ is an option for you, you should use
+them instead.  See "Generating C++ Scanners" above for details.
+<dt>-<dd><b>output()</b> 
+is not supported.
+Output from the
+<b>ECHO</b> 
+macro is done to the file-pointer
+<i>yyout</i> 
+(default
+<i>stdout).</i> 
+<dt><dd><b>output()</b> 
+is not part of the POSIX specification.
+<dt>-<dd><i>lex</i> 
+does not support exclusive start conditions (%x), though they
+are in the POSIX specification.
+<dt>-<dd>When definitions are expanded,
+<i>flex</i> 
+encloses them in parentheses.
+With lex, the following:
+<pre>
+
+<p><br>    NAME    [A-Z][A-Z0-9]*
+<br>    %%
+<br>    foo{NAME}?      printf( "Found it\n" );
+<br>    %%
+<br>
+<p><br></pre>
+will not match the string "foo" because when the macro
+is expanded the rule is equivalent to "foo[A-Z][A-Z0-9]*?"
+and the precedence is such that the '?' is associated with
+"[A-Z0-9]*".  With
+<i>flex,</i> 
+the rule will be expanded to
+"foo([A-Z][A-Z0-9]*)?" and so the string "foo" will match.
+<dt><dd>Note that if the definition begins with
+<b>^</b> 
+or ends with
+<b>$</b> 
+then it is
+<i>not</i> 
+expanded with parentheses, to allow these operators to appear in
+definitions without losing their special meanings.  But the
+<b>&lt;s&gt;,</b> <b>/,</b> 
+and
+<b>&lt;&lt;EOF&gt;&gt;</b> 
+operators cannot be used in a
+<i>flex</i> 
+definition.
+<dt><dd>Using
+<b>-l</b> 
+results in the
+<i>lex</i> 
+behavior of no parentheses around the definition.
+<dt><dd>The POSIX specification is that the definition be enclosed in parentheses.
+<dt>-<dd>Some implementations of
+<i>lex</i> 
+allow a rule's action to begin on a separate line, if the rule's pattern
+has trailing whitespace:
+<pre>
+
+<p><br>    %%
+<br>    foo|bar&lt;space here&gt;
+<br>      { foobar_action(); }
+<br>
+<p><br></pre>
+<i>flex</i> 
+does not support this feature.
+<dt>-<dd>The
+<i>lex</i> 
+<b>%r</b> 
+(generate a Ratfor scanner) option is not supported.  It is not part
+of the POSIX specification.
+<dt>-<dd>After a call to
+<b>unput(),</b> 
+<i>yytext</i> 
+is undefined until the next token is matched, unless the scanner
+was built using
+<b>%array.</b> 
+This is not the case with
+<i>lex</i> 
+or the POSIX specification.  The
+<b>-l</b> 
+option does away with this incompatibility.
+<dt>-<dd>The precedence of the
+<b>{}</b> 
+(numeric range) operator is different.
+<i>lex</i> 
+interprets "abc{1,3}" as "match one, two, or
+three occurrences of 'abc'", whereas
+<i>flex</i> 
+interprets it as "match 'ab'
+followed by one, two, or three occurrences of 'c'".  The latter is
+in agreement with the POSIX specification.
+<dt>-<dd>The precedence of the
+<b>^</b> 
+operator is different.
+<i>lex</i> 
+interprets "^foo|bar" as "match either 'foo' at the beginning of a line,
+or 'bar' anywhere", whereas
+<i>flex</i> 
+interprets it as "match either 'foo' or 'bar' if they come at the beginning
+of a line".  The latter is in agreement with the POSIX specification.
+<dt>-<dd>The special table-size declarations such as
+<b>%a</b> 
+supported by
+<i>lex</i> 
+are not required by
+<i>flex</i> 
+scanners;
+<i>flex</i> 
+ignores them.
+<dt>-<dd>The name
+FLEX_SCANNER
+is #define'd so scanners may be written for use with either
+<i>flex</i> 
+or
+<i>lex.</i> 
+Scanners also include
+<b>YY_FLEX_MAJOR_VERSION</b> 
+and
+<b>YY_FLEX_MINOR_VERSION</b> 
+indicating which version of
+<i>flex</i> 
+generated the scanner
+(for example, for the 2.5 release, these defines would be 2 and 5
+respectively).
+</dl>
+<p>
+The following
+<i>flex</i> 
+features are not included in
+<i>lex</i> 
+or the POSIX specification:
+<pre>
+
+<p><br>    C++ scanners
+<br>    %option
+<br>    start condition scopes
+<br>    start condition stacks
+<br>    interactive/non-interactive scanners
+<br>    yy_scan_string() and friends
+<br>    yyterminate()
+<br>    yy_set_interactive()
+<br>    yy_set_bol()
+<br>    YY_AT_BOL()
+<br>    &lt;&lt;EOF&gt;&gt;
+<br>    &lt;*&gt;
+<br>    YY_DECL
+<br>    YY_START
+<br>    YY_USER_ACTION
+<br>    YY_USER_INIT
+<br>    #line directives
+<br>    %{}'s around actions
+<br>    multiple actions on a line
+<br>
+<p><br></pre>
+plus almost all of the flex flags.
+The last feature in the list refers to the fact that with
+<i>flex</i> 
+you can put multiple actions on the same line, separated with
+semi-colons, while with
+<i>lex,</i> 
+the following
+<pre>
+
+<p><br>    foo    handle_foo(); ++num_foos_seen;
+<br>
+<p><br></pre>
+is (rather surprisingly) truncated to
+<pre>
+
+<p><br>    foo    handle_foo();
+<br>
+<p><br></pre>
+<i>flex</i> 
+does not truncate the action.  Actions that are not enclosed in
+braces are simply terminated at the end of the line.
+
+</ul><H2>DIAGNOSTICS </H2><ul>
+
+
+<p>
+<i>warning,</i> <i>rule</i> <i>cannot</i> <i>be</i> <i>matched</i> 
+indicates that the given rule
+cannot be matched because it follows other rules that will
+always match the same text as it.  For
+example, in the following "foo" cannot be matched because it comes after
+an identifier "catch-all" rule:
+<pre>
+
+<p><br>    [a-z]+    got_identifier();
+<br>    foo       got_foo();
+<br>
+<p><br></pre>
+Using
+<b>REJECT</b> 
+in a scanner suppresses this warning.
+
+<p>
+<i>warning,</i> 
+<b>-s</b> 
+<i>option given but default rule can be matched
+</i>means that it is possible (perhaps only in a particular start condition)
+that the default rule (match any single character) is the only one
+that will match a particular input.  Since
+<b>-s</b> 
+was given, presumably this is not intended.
+
+<p>
+<i>reject_used_but_not_detected</i> <i>undefined</i> 
+or
+<i>yymore_used_but_not_detected</i> <i>undefined</i> <i>-</i> 
+These errors can occur at compile time.  They indicate that the
+scanner uses
+<b>REJECT</b> 
+or
+<b>yymore()</b> 
+but that
+<i>flex</i> 
+failed to notice the fact, meaning that
+<i>flex</i> 
+scanned the first two sections looking for occurrences of these actions
+and failed to find any, but somehow you snuck some in (via a #include
+file, for example).  Use
+<b>%option</b> <b>reject</b> 
+or
+<b>%option</b> <b>yymore</b> 
+to indicate to flex that you really do use these features.
+
+<p>
+<i>flex</i> <i>scanner</i> <i>jammed</i> <i>-</i> 
+a scanner compiled with
+<b>-s</b> 
+has encountered an input string which wasn't matched by
+any of its rules.  This error can also occur due to internal problems.
+
+<p>
+<i>token</i> <i>too</i> <i>large,</i> <i>exceeds</i> <i>YYLMAX</i> <i>-</i> 
+your scanner uses
+<b>%array</b> 
+and one of its rules matched a string longer than the
+<b>YYLMAX</b> 
+constant (8K bytes by default).  You can increase the value by
+#define'ing
+<b>YYLMAX</b> 
+in the definitions section of your
+<i>flex</i> 
+input.
+
+<p>
+<i>scanner</i> <i>requires</i> <i>-8</i> <i>flag</i> <i>to</i> 
+<i>use</i> <i>the</i> <i>character</i> <i>'x'</i> <i>-</i> 
+Your scanner specification includes recognizing the 8-bit character
+<i>'x'</i> 
+and you did not specify the -8 flag, and your scanner defaulted to 7-bit
+because you used the
+<b>-Cf</b> 
+or
+<b>-CF</b> 
+table compression options.  See the discussion of the
+<b>-7</b> 
+flag for details.
+
+<p>
+<i>flex</i> <i>scanner</i> <i>push-back</i> <i>overflow</i> <i>-</i> 
+you used
+<b>unput()</b> 
+to push back so much text that the scanner's buffer could not hold
+both the pushed-back text and the current token in
+<b>yytext.</b> 
+Ideally the scanner should dynamically resize the buffer in this case, but at
+present it does not.
+
+<p>
+<i>input buffer overflow, can't enlarge buffer because scanner uses REJECT -
+</i>the scanner was working on matching an extremely large token and needed
+to expand the input buffer.  This doesn't work with scanners that use
+<b>REJECT.
+</b>
+<p>
+<i>fatal flex scanner internal error--end of buffer missed -
+</i>This can occur in an scanner which is reentered after a long-jump
+has jumped out (or over) the scanner's activation frame.  Before
+reentering the scanner, use:
+<pre>
+
+<p><br>    yyrestart( yyin );
+<br>
+<p><br></pre>
+or, as noted above, switch to using the C++ scanner class.
+
+<p>
+<i>too</i> <i>many</i> <i>start</i> <i>conditions</i> <i>in</i> <i>&lt;&gt;</i> <i>construct!</i> <i>-</i> 
+you listed more start conditions in a &lt;&gt; construct than exist (so
+you must have listed at least one of them twice).
+
+</ul><H2>FILES </H2><ul>
+
+<p><dl compact><dt><b>-lfl</b> 
+<dd>library with which scanners must be linked.
+<dt><i>lex.yy.c</i> 
+<dd>generated scanner (called
+<i>lexyy.c</i> 
+on some systems).
+<dt><i>lex.yy.cc</i> 
+<dd>generated C++ scanner class, when using
+<b>-+.</b> 
+<dt><i>&lt;FlexLexer.h&gt;</i> 
+<dd>header file defining the C++ scanner base class,
+<b>FlexLexer,</b> 
+and its derived class,
+<b>yyFlexLexer.</b> 
+<dt><i>flex.skl</i> 
+<dd>skeleton scanner.  This file is only used when building flex, not when
+flex executes.
+<dt><i>lex.backup</i> 
+<dd>backing-up information for
+<b>-b</b> 
+flag (called
+<i>lex.bck</i> 
+on some systems).
+</dl>
+</ul><H2>DEFICIENCIES / BUGS </H2><ul>
+
+
+<p>
+Some trailing context
+patterns cannot be properly matched and generate
+warning messages ("dangerous trailing context").  These are
+patterns where the ending of the
+first part of the rule matches the beginning of the second
+part, such as "zx*/xy*", where the 'x*' matches the 'x' at
+the beginning of the trailing context.  (Note that the POSIX draft
+states that the text matched by such patterns is undefined.)
+
+<p>
+For some trailing context rules, parts which are actually fixed-length are
+not recognized as such, leading to the abovementioned performance loss.
+In particular, parts using '|' or {n} (such as "foo{3}") are always
+considered variable-length.
+
+<p>
+Combining trailing context with the special '|' action can result in
+<i>fixed</i> 
+trailing context being turned into the more expensive
+<i>variable</i> 
+trailing context.  For example, in the following:
+<pre>
+
+<p><br>    %%
+<br>    abc      |
+<br>    xyz/def
+<br>
+<p><br></pre>
+
+<p>
+Use of
+<b>unput()</b> 
+invalidates yytext and yyleng, unless the
+<b>%array</b> 
+directive
+or the
+<b>-l</b> 
+option has been used.
+
+<p>
+Pattern-matching of NUL's is substantially slower than matching other
+characters.
+
+<p>
+Dynamic resizing of the input buffer is slow, as it entails rescanning
+all the text matched so far by the current (generally huge) token.
+
+<p>
+Due to both buffering of input and read-ahead, you cannot intermix
+calls to &lt;stdio.h&gt; routines, such as, for example,
+<b>getchar(),</b> 
+with
+<i>flex</i> 
+rules and expect it to work.  Call
+<b>input()</b> 
+instead.
+
+<p>
+The total table entries listed by the
+<b>-v</b> 
+flag excludes the number of table entries needed to determine
+what rule has been matched.  The number of entries is equal
+to the number of DFA states if the scanner does not use
+<b>REJECT,</b> 
+and somewhat greater than the number of states if it does.
+
+<p>
+<b>REJECT</b> 
+cannot be used with the
+<b>-f</b> 
+or
+<b>-F</b> 
+options.
+
+<p>
+The
+<i>flex</i> 
+internal algorithms need documentation.
+
+</ul><H2>SEE ALSO </H2><ul>
+
+
+<p>
+lex(1), yacc(1), sed(1), awk(1).
+
+<p>
+John Levine, Tony Mason, and Doug Brown,
+<i>Lex</i> <i>&amp;</i> <i>Yacc,</i> 
+O'Reilly and Associates.  Be sure to get the 2nd edition.
+
+<p>
+M. E. Lesk and E. Schmidt,
+<i>LEX</i> <i>-</i> <i>Lexical</i> <i>Analyzer</i> <i>Generator</i> 
+
+<p>
+Alfred Aho, Ravi Sethi and Jeffrey Ullman,
+<i>Compilers:</i> <i>Principles,</i> <i>Techniques</i> <i>and</i> <i>Tools,</i> 
+Addison-Wesley (1986).  Describes the pattern-matching techniques used by
+<i>flex</i> 
+(deterministic finite automata).
+
+</ul><H2>AUTHOR </H2><ul>
+
+Vern Paxson, with the help of many ideas and much inspiration from
+Van Jacobson.  Original version by Jef Poskanzer.  The fast table
+representation is a partial implementation of a design done by Van
+Jacobson.  The implementation was done by Kevin Gong and Vern Paxson.
+
+<p>
+Thanks to the many
+<i>flex</i> 
+beta-testers, feedbackers, and contributors, especially Francois Pinard,
+Casey Leedom,
+Stan Adermann, Terry Allen, David Barker-Plummer, John Basrai,
+Nelson H.F. Beebe, [email protected],
+Karl Berry, Peter A. Bigot, Simon Blanchard,
+Keith Bostic, Frederic Brehm, Ian Brockbank, Kin Cho, Nick Christopher,
+Brian Clapper, J.T. Conklin,
+Jason Coughlin, Bill Cox, Nick Cropper, Dave Curtis, Scott David
+Daniels, Chris G. Demetriou, Theo Deraadt,
+Mike Donahue, Chuck Doucette, Tom Epperly, Leo Eskin,
+Chris Faylor, Chris Flatters, Jon Forrest, Joe Gayda, Kaveh R. Ghazi,
+Eric Goldman, Christopher M. Gould, Ulrich Grepel, Peer Griebel,
+Jan Hajic, Charles Hemphill, NORO Hideo,
+Jarkko Hietaniemi, Scott Hofmann,
+Jeff Honig, Dana Hudes, Eric Hughes, John Interrante,
+Ceriel Jacobs, Michal Jaegermann, Sakari Jalovaara, Jeffrey R. Jones,
+Henry Juengst, Klaus Kaempf, Jonathan I. Kamens, Terrence O Kane,
+Amir Katz, [email protected], Kevin B. Kenny,
+Steve Kirsch, Winfried Koenig, Marq Kole, Ronald Lamprecht,
+Greg Lee, Rohan Lenard, Craig Leres, John Levine, Steve Liddle, Mike Long,
+Mohamed el Lozy, Brian Madsen, Malte, Joe Marshall,
+Bengt Martensson, Chris Metcalf,
+Luke Mewburn, Jim Meyering, R. Alexander Milowski, Erik Naggum,
+G.T. Nicol, Landon Noll, James Nordby, Marc Nozell,
+Richard Ohnemus, Karsten Pahnke,
+Sven Panne, Roland Pesch, Walter Pelissero, Gaumond
+Pierre, Esmond Pitt, Jef Poskanzer, Joe Rahmeh, Jarmo Raiha,
+Frederic Raimbault, Pat Rankin, Rick Richardson,
+Kevin Rodgers, Kai Uwe Rommel, Jim Roskind, Alberto Santini,
+Andreas Scherer, Darrell Schiebel, Raf Schietekat,
+Doug Schmidt, Philippe Schnoebelen, Andreas Schwab,
+Alex Siegel, Eckehard Stolz, Jan-Erik Strvmquist,
+Mike Stump, Paul Stuart, Dave Tallman, Ian Lance Taylor,
+Chris Thewalt, Richard M. Timoney, Jodi Tsai,
+Paul Tuinenga, Gary Weik, Frank Whaley, Gerhard Wilhelms, Kent Williams, Ken
+Yap, Ron Zellar, Nathan Zelle, David Zuhn,
+and those whose names have slipped my marginal
+mail-archiving skills but whose contributions are appreciated all the
+same.
+
+<p>
+Thanks to Keith Bostic, Jon Forrest, Noah Friedman,
+John Gilmore, Craig Leres, John Levine, Bob Mulcahy, G.T.
+Nicol, Francois Pinard, Rich Salz, and Richard Stallman for help with various
+distribution headaches.
+
+<p>
+Thanks to Esmond Pitt and Earle Horton for 8-bit character support; to
+Benson Margulies and Fred Burke for C++ support; to Kent Williams and Tom
+Epperly for C++ class support; to Ove Ewerlid for support of NUL's; and to
+Eric Hughes for support of multiple buffers.
+
+<p>
+This work was primarily done when I was with the Real Time Systems Group
+at the Lawrence Berkeley Laboratory in Berkeley, CA.  Many thanks to all there
+for the support I received.
+
+<p>
+Send comments to [email protected].
+</ul></body></html>

Engine/bin/nasm/Licence

@@ -0,0 +1,357 @@
+
+
+
+Terms and Conditions for the use of the Netwide Assembler
+
+
+=========================================================
+
+
+
+
+
+Can I have the gist without reading the legalese?
+
+
+-------------------------------------------------
+
+
+
+
+
+Basically, NASM is free. You can't charge for it. You can copy it as
+
+
+much as you like. You can incorporate it, or bits of it, into other
+
+
+free programs if you want. (But we want to know about it if you do,
+
+
+and we want to be mentioned in the credits.) We may well allow you
+
+
+to incorporate it into commercial software too, but we'll probably
+
+
+demand some money for it, and we'll certainly demand to be given
+
+
+credit. And in extreme cases (although I can't immediately think of
+
+
+a reason we might actually want to do this) we may refuse to let you
+
+
+do it at all.
+
+
+
+
+
+NASM LICENCE AGREEMENT
+
+
+======================
+
+
+
+
+
+By "the Software" this licence refers to the complete contents of
+
+
+the NASM archive, excluding this licence document itself, and
+
+
+excluding the contents of the `test' directory. The Netwide
+
+
+Disassembler, NDISASM, is specifically included under this licence.
+
+
+
+
+
+I. The Software is freely redistributable; anyone may copy the
+
+
+Software, or parts of the Software, and give away as many copies as
+
+
+they like to anyone, as long as this licence document is kept with
+
+
+the Software. Charging a fee for the Software is prohibited,
+
+
+although a fee may be charged for the act of transferring a copy,
+
+
+and you can offer warranty protection and charge a fee for that.
+
+
+
+
+
+II. The Software, or parts thereof, may be incorporated into other
+
+
+freely redistributable software (by which we mean software that may
+
+
+be obtained free of charge) without requiring permission from the
+
+
+authors, as long as due credit is given to the authors of the
+
+
+Software in the resulting work, as long as the authors are informed
+
+
+of this action if possible, and as long as those parts of the
+
+
+Software that are used remain under this licence.
+
+
+
+
+
+III. Modified forms of the Software may be created and distributed
+
+
+as long as the authors are informed of this action if possible, as
+
+
+long as the resulting work remains under this licence, as long as
+
+
+the modified form of the Software is distributed with documentation
+
+
+which still gives credit to the original authors of the Software,
+
+
+and as long as the modified form of the Software is distributed with
+
+
+a clear statement that it is not the original form of the Software
+
+
+in the form that it was distributed by the authors.
+
+
+
+
+
+IV. The Software, or parts thereof, may be incorporated into other
+
+
+software which is not freely redistributable (i.e. software for
+
+
+which a fee is charged), as long as permission is granted from the
+
+
+authors of the Software. The authors reserve the right to grant this
+
+
+permission only for a fee, which may at our option take the form of
+
+
+royalty payments. The authors also reserve the right to refuse to
+
+
+grant permission if they deem it necessary. For further information
+
+
+about who exactly the authors are, see clause XI below.
+
+
+
+
+
+V. The Software may be incorporated, in its original archive form,
+
+
+into software collections or archives which are not freely
+
+
+redistributable, as long as it is clearly stated that the Software
+
+
+itself remains freely redistributable and remains under this licence
+
+
+and no other. Such collections are deemed not to fall under article
+
+
+IV of this licence.
+
+
+
+
+
+VI. Object files or programs generated by the Software as output do
+
+
+not fall under this licence at all, and may be placed under any
+
+
+licence the author wishes. The authors explicitly lay no claim to,
+
+
+and assert no rights over, any programs written by other people and
+
+
+assembled into object form by the Software.
+
+
+
+
+
+VII. You may not copy, modify or distribute the Software except
+
+
+under the terms given in this licence document. You may not
+
+
+sublicense the Software or in any way place it under any other
+
+
+licence than this one. Since you have not signed this licence, you
+
+
+are not of course required to accept it; however, no other licence
+
+
+applies to the Software, and nothing else grants you any permission
+
+
+to copy, modify, sublicense or distribute the Software in any way.
+
+
+These actions are therefore prohibited if you do not accept this
+
+
+licence.
+
+
+
+
+
+VIII. There is no warranty for the Software, to the extent permitted
+
+
+by applicable law. The authors provide the Software "as is" without
+
+
+warranty of any kind, either expressed or implied, including but not
+
+
+limited to the implied warranties of merchantability and fitness for
+
+
+a particular purpose. The entire risk as to the quality and
+
+
+performance of the Software is with you. Should the Software prove
+
+
+defective, you assume the cost of all necessary servicing, repair or
+
+
+correction.
+
+
+
+
+
+IX. In no event, unless required by applicable law or agreed to in
+
+
+writing, will any of the authors be liable to you for damages,
+
+
+including any general, special, incidental or consequential damages,
+
+
+arising out of the use or the inability to use the Software,
+
+
+including but not limited to loss of data or data being rendered
+
+
+inaccurate or a failure of the Software to operate with any other
+
+
+programs, even if you have been advised of the possibility of such
+
+
+damages.
+
+
+
+
+
+X. In addition to what this Licence otherwise provides, the Software
+
+
+may be distributed in such a way as to be compliant with the GNU
+
+
+General Public Licence, as published by the Free Software Foundation,
+
+
+Cambridge, MA, USA; version 2, or, at your option, any later version;
+
+
+incorporated herein by reference.  You must include a copy of this
+
+
+Licence with such distribution.  Furthermore, patches sent to the
+
+
+authors for the purpose of inclusion in the official release version
+
+
+are considered cleared for release under the full terms of this
+
+
+Licence.
+
+
+
+
+
+XI. The authors of NASM are the original authors (Simon Tatham and
+
+
+Julian Hall) and all those who the original authors feel have
+
+
+contributed significantly to the overall project.  If you wish to
+
+
+contact the authors, Julian Hall ([email protected]) should be your
+
+
+first port of call.
+
+
+
+
+
+XII. Should any part of this agreement be deemed unenforcable, it is
+
+
+intended that the remainder of the agreement be held in force.
+
+
+
+
+
+END OF LICENCE AGREEMENT
+
+

Engine/bin/nasm/Readme

@@ -0,0 +1,179 @@
+This is a distribution of NASM, the Netwide Assembler. NASM is a
+prototype general-purpose x86 assembler. It will currently output
+flat-form binary files, a.out, COFF and ELF Unix object files,
+Microsoft Win32 and 16-bit DOS object files, OS/2 object files, the
+as86 object format, and a home-grown format called RDOFF.
+
+Also included is NDISASM, a prototype x86 binary-file disassembler
+which uses the same instruction table as NASM.
+
+To install NASM on UNIX or Linux, type `./configure', then `make', and
+then either `make install', or copy the file `nasm' (and maybe
+`ndisasm') to a directory on your search path (maybe /usr/local/bin,
+or ~/bin if you don't have root access). You may also want to copy the
+man page `nasm.1' (and maybe `ndisasm.1') to somewhere sensible.  Note
+that source and binaries are also available in RPM format; to install
+an RPM on a system which uses this packaging format (mostly Linux
+distributions) simply do "rpm -Uivh filename.rpm".
+
+To install under DOS, if you don't need to rebuild from the sources,
+you can just copy either nasm.exe and ndisasm.exe (32-bit DOS-extended
+versions), nasmr.exe and ndisasmr.exe (16-bit classical DOS
+executables), or nasmw.exe and ndisasmw.exe (Win32 console
+applications - less likely to run out of memory), to somewhere on your
+PATH.
+
+The 32-bit applications require a DPMI server.  If you're running
+under plain DOS and don't have a DPMI server already, you can get
+CSDPMI from ftp://ftp.simtel.net/pub/simtelnet/gnu/djgpp/v2misc/.
+
+To rebuild the DOS sources, various makefiles are provided:
+
+- Makefile.dos, the one I build the standard 16-bit releases from,
+  designed for a hybrid system using Microsoft C and Borland Make
+  (don't ask why :-)
+- Makefile.vc, for Microsoft Visual C++ compiling to a Win32
+  command-line application. This is the one I build the standard
+  Win32 release binaries from.
+
+- Makefile.bor, for Borland C.
+- Makefile.bc2, also for Borland C, contributed by Fox Cutter.
+  Reported to work better than Makefile.bor on some systems.
+
+- Makefile.sc, for Symantec C++, compiling to a 32-bit extended DOS
+  executable.. Contributed by Mark Junker.
+- Makefile.scw, also for Symantec C++, compiling to a Win32 command-
+  line application. Also contributed by Mark Junker.
+
+- Makefile.wc, for Watcom C, compiling to a 32-bit extended DOS
+  executable. Contributed by Dominik Behr.
+- Makefile.wcw, also for Watcom C, compiling to a Win32 command-
+  line application. Also contributed by Dominik Behr.
+
+- Makefile.dj, for DJGPP, compiling to a 32-bit extended DOS
+  executable. Contributed by Dominik Behr.
+
+- Makefile.lcc, for lcc-win32, compiling to a Win32 command line
+  application. (The lcc-win32 compiler and tools are available from
+  http://www.remcomp.com/lcc-win32/)
+
+I can't guarantee that all of those makefiles work, because I don't
+have all of those compilers. However, Makefile.dos and Makefile.vc
+work on my system, and so do Makefile.bor and Makefile.bc2.
+
+Be careful with Borland C: there have been various conflicting
+reports about how reliable the Huge memory model is. If you try to
+compile NASM in Large model, you may get DGROUP overflows due to the
+vast quantity of data in the instruction tables. I've had reports
+from some people that Huge model doesn't work at all (and also
+reports from others that it works fine), so if you don't want to try
+moving to Huge, you could try adding the option `-dc' to the
+compiler command line instead, which causes string literals to be
+moved from DGROUP to the code segments and might make Large model
+start working. (Either solution works for me.)
+
+To rebuild truly from scratch, or to make any changes to insns.dat or
+standard.mac, you need a Perl interpreter installed.  Perl
+interpreters are available for a number of platforms, from:
+
+	http://www.cpan.org/ports/
+
+For DOS you can also get one from:
+
+	ftp://ftp.simtel.net/pub/simtelnet/gnu/djgpp/v2gnu/
+
+Dominik Behr has also contributed the file misc/pmw.bat, which is a
+batch file to turn the output from Makefile.wc (NASM.EXE and
+NDISASM.EXE) into standalone executables incorporating Tran's
+PMODE/W DOS extender, rather than depending on an external extender
+program.
+
+Some of the Windows makefiles produce executables called nasmw.exe
+and ndisasmw.exe, and some don't. Be prepared for either...
+
+If you want to build a restricted version of NASM containing only
+some of the object file formats, you can achieve this by adding
+#defines to `outform.h' (see the file itself for documentation), or
+equivalently by adding compiler command line options in the
+Makefile.
+
+There is a machine description file for the `LCC' retargetable C
+compiler (version 4.0), in the directory `lcc', along with
+instructions for its use. This means that NASM can now be used as
+the code-generator back end for a useful C compiler.
+
+Michael `Wuschel' Tippach has ported his DOS extender `WDOSX' to
+enable it to work with the 32-bit binary files NASM can output: the
+original extender and his port `WDOSX/N' are available from his web
+page, http://www.geocities.com/SiliconValley/Park/4493.
+
+Matt Mastracci has written a document explaining how to write
+assembly language modules in DJGPP programs using NASM: it's on his
+web site at http://www.ucalgary.ca/~mmastrac/djgppasm.doc.
+
+The `misc' directory contains `nasm.sl', a NASM editing mode for the
+JED programmers' editor (see http://space.mit.edu/~davis/jed.html
+for details about JED). The comment at the start of the file gives
+instructions on how to install the mode. This directory also
+contains a file (`magic') containing lines to add to /etc/magic on
+Unix systems to allow the `file' command to recognise RDF files, and
+a zip file (`exasm.zip') containing the necessary files for syntax
+highlighting in the Aurora DOS editor. (The Aurora files were
+contributed by <[email protected]>; I haven't tested them as I
+don't have Aurora.)
+
+The `rdoff' directory contains sources for a linker and loader for
+the RDF object file format, to run under Linux, and also
+documentation on the internal structure of RDF files.
+
+For information about how you can distribute and use NASM, see the
+file Licence. We were tempted to put NASM under the GPL, but decided
+that in many ways it was too restrictive for developers.
+
+For release 0.98 and later, the NASM source distribution contains the
+following components:
+
+          Unix                      Windows, OS/2               DOS
+
+          nasm-X.XX.tar.gz          nasm-X.XX.zip               nasmXXXs.zip
+
+          Main archive: Contain all sources you need to build NASM,
+          plus the documentation source code.  If you have a Perl
+          interpreter and (possibly) Winhelp compiler installed, you
+          don't need any additional files.
+
+          nasm-X.XX-xdoc.tar.gz     nasm-X.XX-xdoc.zip          nasmXXXd.zip
+
+          Documentation in HTML, INFO, text, and PostScript format.
+          You can compile these files yourself from the main archive
+          if you have a Perl interpreter installed.
+
+          N/A                       nasm-X.XX-whlp.zip          N/A
+
+          Documentation in Windows help format.  You can compile this
+          file yourself from the main archive if you have a Perl
+          interpreter and a Winhelp compiler installed.
+
+The Unix, Windows-OS/2, and DOS versions differ in the following ways:
+
+The Unix version uses the Unix line ending convention (LF), and long file
+names with upper and lower case.
+
+The Windows-OS/2 version uses the Microsoft line ending convention
+(CR+LF), and long file names with upper and lower case.
+
+The DOS version uses the Microsoft line ending convention (CR+LF),
+with all filenames in 8.3 monocase.
+
+For information about how to use NASM, see the various forms of
+documentation in the `doc' directory: documentation is provided in
+HTML, PostScript, plain text, Texinfo, and Windows Help formats. For
+information about how to use NDISASM, see `ndisasm.doc'. For
+information about the internal structure of NASM, see
+`internal.doc'. (In particular, _please_ read `internal.doc' before
+writing any code for us...)
+
+The NASM web page is at http://www.cryogen.com/Nasm/
+
+Bug reports (and patches if you can) should be sent to
+<[email protected]>.

Engine/bin/tools/comments/CB7C7F15-A958-4A75-9AED-29A41AEFF30C.xml

@@ -0,0 +1,9 @@
+<!DOCTYPE Comments>
+<Comments>
+   <Project Name="Demos-Physics" >
+      <Comment Author="Torque 3D" Name="Mon Oct 12 15:12:23 2009" >A singleplayer demo of the integrated PhysX support in Torque 3D</Comment>
+   </Project>
+   <Project Name="Examples-FPS Example" >
+      <Comment Author="Torque 3D" Name="Mon Oct 12 15:13:35 2009" >An example of a multiplayer first person shooter built with the stock Torque 3D functionality</Comment>
+   </Project>
+</Comments>

Engine/bin/tools/documentation/index.html

@@ -0,0 +1,46 @@
+<html>
+<head>
+<style>
+h2 { color:#232323;}
+p a{text-decoration:none; color:#000000} 
+p a:visited{text-decoration:none; color:#000000}
+a{text-decoration:none; color:#005698}
+a:visited{text-decoration:none; color:#00a4ff} 
+</style>
+</head>
+<body>
+	<table>
+		<tr>
+			<td width="245">
+				<a href="http://www.garagegames.com/products/torque-3d/documentation/user/doc34"><img src="docs-newuser.png"></a>
+				<a href="http://www.garagegames.com/products/torque-3d/documentation/user/doc70"><img src="docs-artist.png"></a>
+				<a href="http://www.garagegames.com/products/torque-3d/documentation/user/doc43"><img src="docs-scripter.png"></a>
+				<ul>
+					<li> <strong>Getting Started</strong>
+					<br>
+						<ul>
+							<li><a href="http://www.garagegames.com/products/torque-3d/documentation/user/doc34" target="_blank">Torque 3D Introduction</a></li>
+							<li><a href="http://www.garagegames.com/products/torque-3d/documentation/user/doc60">Setting Up Your Environment</a></li>
+							<li><a href="http://www.garagegames.com/products/torque-3d/documentation/user/doc35">Directory Overview</a></li>
+							<li><a href="http://www.garagegames.com/products/torque-3d/documentation/user/doc36">Toolbox Documentation</a></li>
+							<li><a href="http://www.garagegames.com/products/torque-3d/guides">Guides</a></li>
+						</ul>
+					</li>
+					<br>
+					<li> <strong>Editors</strong>
+						<ul>
+							<li><a href="http://www.garagegames.com/products/torque-3d/documentation/user/doc77" target="_blank">World Editor</a></li>
+							<li><a href="http://www.garagegames.com/products/torque-3d/documentation/user/doc88" target="_blank">Terrain Editor</a></li>
+							<li><a href="http://www.garagegames.com/products/torque-3d/documentation/user/doc82" target="_blank">Material Editor</a></li>
+							<li><a href="http://www.garagegames.com/products/torque-3d/documentation/user/doc81" target="_blank">Forest Editor</a></li>        
+						</ul>
+					</li>
+				</ul>
+			</td>
+			<td>
+				<a href="http://www.garagegames.com/products/torque-3d/fps"><img src="Tutorials.png"></a>
+			</td>
+		</tr>
+	</table>
+</body>
+</html>

Engine/bin/tools/getD3DXVer/app/ReadMe.txt

@@ -0,0 +1,5 @@
+getD3DXVer Notes:
+
+- Current compiled version checks for d3dx9_41.dll.  This is based on March 2009 DirectX SDK.
+
+- Be sure to recompile the executable if the required DirectX SDK changes.  The D3DX DLL version is automatically taken from d3dx9core.h so only a recompile is required.

Engine/bin/tools/getD3DXVer/source/getD3DXVer.cpp

@@ -0,0 +1,60 @@
+//-----------------------------------------------------------------------------
+// Copyright (c) 2012 GarageGames, LLC
+//
+// Permission is hereby granted, free of charge, to any person obtaining a copy
+// of this software and associated documentation files (the "Software"), to
+// deal in the Software without restriction, including without limitation the
+// rights to use, copy, modify, merge, publish, distribute, sublicense, and/or
+// sell copies of the Software, and to permit persons to whom the Software is
+// furnished to do so, subject to the following conditions:
+//
+// The above copyright notice and this permission notice shall be included in
+// all copies or substantial portions of the Software.
+//
+// THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
+// IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
+// FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
+// AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
+// LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING
+// FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS
+// IN THE SOFTWARE.
+//-----------------------------------------------------------------------------
+
+//-----------------------------------------------------------------------------
+// getD3DXVer.exe
+//
+// Checks for the existance of the correct D3DX library.  Automatically
+// uses the D3DX library version this executable was compiled against.
+// (As contained in D3dx9core.h)
+//-----------------------------------------------------------------------------
+
+#include "stdafx.h"
+#include <D3dx9core.h>
+#include <windows.h>
+
+int _tmain(int argc, _TCHAR* argv[])
+{
+   // Method documented at http://msdn.microsoft.com/en-us/library/bb172717(VS.85).aspx
+   // NOTE: Went with a different check below as this one requires linking with
+   // the correct D3DX library to begin with.
+   //if ( !D3DXCheckVersion(D3D_SDK_VERSION, D3DX_SDK_VERSION) )
+   //{
+   //   return 1;
+   //}
+
+   // Perform a simple LoadLibrary to check for the correct D3DX
+   _TCHAR name[64];
+   _stprintf(name, _T("d3dx9_%d.dll"), D3DX_SDK_VERSION);
+   HINSTANCE hinstLib = LoadLibrary(name);
+   if( !hinstLib )
+   {
+      //_tprintf(_T("'%s' lib NOT found"), name);
+      return 1;
+   }
+
+   FreeLibrary(hinstLib);
+
+   //_tprintf(_T("'%s' lib was found"), name);
+   return 0;
+}
+

Engine/bin/tools/getD3DXVer/source/getD3DXVer.sln

@@ -0,0 +1,20 @@
+
+Microsoft Visual Studio Solution File, Format Version 9.00
+# Visual Studio 2005
+Project("{8BC9CEB8-8B4A-11D0-8D11-00A0C91BC942}") = "getD3DXVer", "getD3DXVer.vcproj", "{38452831-9FDC-4961-ACE8-DF4A0EC06471}"
+EndProject
+Global
+	GlobalSection(SolutionConfigurationPlatforms) = preSolution
+		Debug|Win32 = Debug|Win32
+		Release|Win32 = Release|Win32
+	EndGlobalSection
+	GlobalSection(ProjectConfigurationPlatforms) = postSolution
+		{38452831-9FDC-4961-ACE8-DF4A0EC06471}.Debug|Win32.ActiveCfg = Debug|Win32
+		{38452831-9FDC-4961-ACE8-DF4A0EC06471}.Debug|Win32.Build.0 = Debug|Win32
+		{38452831-9FDC-4961-ACE8-DF4A0EC06471}.Release|Win32.ActiveCfg = Release|Win32
+		{38452831-9FDC-4961-ACE8-DF4A0EC06471}.Release|Win32.Build.0 = Release|Win32
+	EndGlobalSection
+	GlobalSection(SolutionProperties) = preSolution
+		HideSolutionNode = FALSE
+	EndGlobalSection
+EndGlobal

Engine/bin/tools/getD3DXVer/source/getD3DXVer.vcproj

@@ -0,0 +1,211 @@
+<?xml version="1.0" encoding="Windows-1252"?>
+<VisualStudioProject
+	ProjectType="Visual C++"
+	Version="8.00"
+	Name="getD3DXVer"
+	ProjectGUID="{38452831-9FDC-4961-ACE8-DF4A0EC06471}"
+	RootNamespace="getD3DXVer"
+	Keyword="Win32Proj"
+	>
+	<Platforms>
+		<Platform
+			Name="Win32"
+		/>
+	</Platforms>
+	<ToolFiles>
+	</ToolFiles>
+	<Configurations>
+		<Configuration
+			Name="Debug|Win32"
+			OutputDirectory="$(SolutionDir)$(ConfigurationName)"
+			IntermediateDirectory="$(ConfigurationName)"
+			ConfigurationType="1"
+			CharacterSet="1"
+			>
+			<Tool
+				Name="VCPreBuildEventTool"
+			/>
+			<Tool
+				Name="VCCustomBuildTool"
+			/>
+			<Tool
+				Name="VCXMLDataGeneratorTool"
+			/>
+			<Tool
+				Name="VCWebServiceProxyGeneratorTool"
+			/>
+			<Tool
+				Name="VCMIDLTool"
+			/>
+			<Tool
+				Name="VCCLCompilerTool"
+				Optimization="0"
+				PreprocessorDefinitions="WIN32;_DEBUG;_CONSOLE;_CRT_SECURE_NO_WARNINGS;_CRT_NON_CONFORMING_SWPRINTFS"
+				MinimalRebuild="true"
+				BasicRuntimeChecks="3"
+				RuntimeLibrary="3"
+				UsePrecompiledHeader="0"
+				WarningLevel="3"
+				Detect64BitPortabilityProblems="true"
+				DebugInformationFormat="4"
+			/>
+			<Tool
+				Name="VCManagedResourceCompilerTool"
+			/>
+			<Tool
+				Name="VCResourceCompilerTool"
+			/>
+			<Tool
+				Name="VCPreLinkEventTool"
+			/>
+			<Tool
+				Name="VCLinkerTool"
+				OutputFile="..\..\..\$(ProjectName).exe"
+				LinkIncremental="2"
+				GenerateDebugInformation="true"
+				SubSystem="1"
+				TargetMachine="1"
+			/>
+			<Tool
+				Name="VCALinkTool"
+			/>
+			<Tool
+				Name="VCManifestTool"
+			/>
+			<Tool
+				Name="VCXDCMakeTool"
+			/>
+			<Tool
+				Name="VCBscMakeTool"
+			/>
+			<Tool
+				Name="VCFxCopTool"
+			/>
+			<Tool
+				Name="VCAppVerifierTool"
+			/>
+			<Tool
+				Name="VCWebDeploymentTool"
+			/>
+			<Tool
+				Name="VCPostBuildEventTool"
+			/>
+		</Configuration>
+		<Configuration
+			Name="Release|Win32"
+			OutputDirectory="$(SolutionDir)$(ConfigurationName)"
+			IntermediateDirectory="$(ConfigurationName)"
+			ConfigurationType="1"
+			CharacterSet="1"
+			WholeProgramOptimization="1"
+			>
+			<Tool
+				Name="VCPreBuildEventTool"
+			/>
+			<Tool
+				Name="VCCustomBuildTool"
+			/>
+			<Tool
+				Name="VCXMLDataGeneratorTool"
+			/>
+			<Tool
+				Name="VCWebServiceProxyGeneratorTool"
+			/>
+			<Tool
+				Name="VCMIDLTool"
+			/>
+			<Tool
+				Name="VCCLCompilerTool"
+				PreprocessorDefinitions="WIN32;NDEBUG;_CONSOLE;_CRT_SECURE_NO_WARNINGS;_CRT_NON_CONFORMING_SWPRINTFS"
+				RuntimeLibrary="2"
+				UsePrecompiledHeader="0"
+				WarningLevel="3"
+				Detect64BitPortabilityProblems="true"
+				DebugInformationFormat="3"
+			/>
+			<Tool
+				Name="VCManagedResourceCompilerTool"
+			/>
+			<Tool
+				Name="VCResourceCompilerTool"
+			/>
+			<Tool
+				Name="VCPreLinkEventTool"
+			/>
+			<Tool
+				Name="VCLinkerTool"
+				OutputFile="..\..\..\$(ProjectName).exe"
+				LinkIncremental="1"
+				GenerateDebugInformation="false"
+				SubSystem="1"
+				OptimizeReferences="2"
+				EnableCOMDATFolding="2"
+				TargetMachine="1"
+			/>
+			<Tool
+				Name="VCALinkTool"
+			/>
+			<Tool
+				Name="VCManifestTool"
+			/>
+			<Tool
+				Name="VCXDCMakeTool"
+			/>
+			<Tool
+				Name="VCBscMakeTool"
+			/>
+			<Tool
+				Name="VCFxCopTool"
+			/>
+			<Tool
+				Name="VCAppVerifierTool"
+			/>
+			<Tool
+				Name="VCWebDeploymentTool"
+			/>
+			<Tool
+				Name="VCPostBuildEventTool"
+			/>
+		</Configuration>
+	</Configurations>
+	<References>
+	</References>
+	<Files>
+		<Filter
+			Name="Source Files"
+			Filter="cpp;c;cc;cxx;def;odl;idl;hpj;bat;asm;asmx"
+			UniqueIdentifier="{4FC737F1-C7A5-4376-A066-2A32D752A2FF}"
+			>
+			<File
+				RelativePath=".\getD3DXVer.cpp"
+				>
+			</File>
+			<File
+				RelativePath=".\stdafx.cpp"
+				>
+			</File>
+		</Filter>
+		<Filter
+			Name="Header Files"
+			Filter="h;hpp;hxx;hm;inl;inc;xsd"
+			UniqueIdentifier="{93995380-89BD-4b04-88EB-625FBE52EBFB}"
+			>
+			<File
+				RelativePath=".\stdafx.h"
+				>
+			</File>
+		</Filter>
+		<Filter
+			Name="Resource Files"
+			Filter="rc;ico;cur;bmp;dlg;rc2;rct;bin;rgs;gif;jpg;jpeg;jpe;resx;tiff;tif;png;wav"
+			UniqueIdentifier="{67DA6AB6-F800-4c08-8B7A-83BB121AAD01}"
+			>
+		</Filter>
+		<File
+			RelativePath=".\ReadMe.txt"
+			>
+		</File>
+	</Files>
+	<Globals>
+	</Globals>
+</VisualStudioProject>

Engine/bin/tools/getD3DXVer/source/stdafx.cpp

@@ -0,0 +1,30 @@
+//-----------------------------------------------------------------------------
+// Copyright (c) 2012 GarageGames, LLC
+//
+// Permission is hereby granted, free of charge, to any person obtaining a copy
+// of this software and associated documentation files (the "Software"), to
+// deal in the Software without restriction, including without limitation the
+// rights to use, copy, modify, merge, publish, distribute, sublicense, and/or
+// sell copies of the Software, and to permit persons to whom the Software is
+// furnished to do so, subject to the following conditions:
+//
+// The above copyright notice and this permission notice shall be included in
+// all copies or substantial portions of the Software.
+//
+// THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
+// IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
+// FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
+// AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
+// LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING
+// FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS
+// IN THE SOFTWARE.
+//-----------------------------------------------------------------------------
+
+// stdafx.cpp : source file that includes just the standard includes
+// getD3DXVer.pch will be the pre-compiled header
+// stdafx.obj will contain the pre-compiled type information
+
+#include "stdafx.h"
+
+// TODO: reference any additional headers you need in STDAFX.H
+// and not in this file

Engine/bin/tools/getD3DXVer/source/stdafx.h

@@ -0,0 +1,39 @@
+//-----------------------------------------------------------------------------
+// Copyright (c) 2012 GarageGames, LLC
+//
+// Permission is hereby granted, free of charge, to any person obtaining a copy
+// of this software and associated documentation files (the "Software"), to
+// deal in the Software without restriction, including without limitation the
+// rights to use, copy, modify, merge, publish, distribute, sublicense, and/or
+// sell copies of the Software, and to permit persons to whom the Software is
+// furnished to do so, subject to the following conditions:
+//
+// The above copyright notice and this permission notice shall be included in
+// all copies or substantial portions of the Software.
+//
+// THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
+// IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
+// FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
+// AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
+// LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING
+// FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS
+// IN THE SOFTWARE.
+//-----------------------------------------------------------------------------
+
+// stdafx.h : include file for standard system include files,
+// or project specific include files that are used frequently, but
+// are changed infrequently
+//
+
+#pragma once
+
+#ifndef _WIN32_WINNT		// Allow use of features specific to Windows XP or later.                   
+#define _WIN32_WINNT 0x0501	// Change this to the appropriate value to target other versions of Windows.
+#endif						
+
+#include <stdio.h>
+#include <tchar.h>
+
+
+
+// TODO: reference additional headers your program requires here

Engine/bin/tools/nsis/app/COPYING

@@ -0,0 +1,144 @@
+COPYRIGHT
+---------
+
+Copyright (C) 1995-2009 Contributors
+
+More detailed copyright information can be found in the individual source code files.
+
+APPLICABLE LICENSES
+-------------------
+
+* All NSIS source code, plug-ins, documentation, examples, header files and graphics, with the exception of the compression modules and where otherwise noted, are licensed under the zlib/libpng license.
+
+* The zlib compression module for NSIS is licensed under the zlib/libpng license.
+
+* The bzip2 compression module for NSIS is licensed under the bzip2 license.
+
+* The LZMA compression module for NSIS is licensed under the Common Public License version 1.0.
+
+ZLIB/LIBPNG LICENSE
+-------------------
+
+This software is provided 'as-is', without any express or implied warranty. In no event will the authors be held liable for any damages arising from the use of this software.
+
+Permission is granted to anyone to use this software for any purpose, including commercial applications, and to alter it and redistribute it freely, subject to the following restrictions:
+
+      1. The origin of this software must not be misrepresented; you must not claim that you wrote the original software. If you use this software in a product, an acknowledgment in the product documentation would be appreciated but is not required.
+
+      2. Altered source versions must be plainly marked as such, and must not be misrepresented as being the original software.
+
+      3. This notice may not be removed or altered from any source distribution.
+
+BZIP2 LICENSE
+-------------
+
+This program, "bzip2" and associated library "libbzip2", are copyright (C) 1996-2000 Julian R Seward. All rights reserved.
+
+Redistribution and use in source and binary forms, with or without modification, are permitted provided that the following conditions are met:
+
+      1. Redistributions of source code must retain the above copyright notice, this list of conditions and the following disclaimer.
+    
+      2. The origin of this software must not be misrepresented; you must not claim that you wrote the original software. If you use this software in a product, an acknowledgment in the product documentation would be appreciated but is not required.
+
+      3. Altered source versions must be plainly marked as such, and must not be misrepresented as being the original software.
+
+      4. The name of the author may not be used to endorse or promote products derived from this software without specific prior written permission.
+
+THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
+
+Julian Seward, Cambridge, UK.
+
[email protected]
+
+COMMON PUBLIC LICENSE VERSION 1.0
+---------------------------------
+
+THE ACCOMPANYING PROGRAM IS PROVIDED UNDER THE TERMS OF THIS COMMON PUBLIC LICENSE ("AGREEMENT"). ANY USE, REPRODUCTION OR DISTRIBUTION OF THE PROGRAM CONSTITUTES RECIPIENT'S ACCEPTANCE OF THIS AGREEMENT.
+
+1. DEFINITIONS
+
+"Contribution" means:
+
+      a) in the case of the initial Contributor, the initial code and documentation distributed under this Agreement, and
+      b) in the case of each subsequent Contributor:
+
+      i) changes to the Program, and
+
+      ii) additions to the Program;
+
+      where such changes and/or additions to the Program originate from and are distributed by that particular Contributor. A Contribution 'originates' from a Contributor if it was added to the Program by such Contributor itself or anyone acting on such Contributor's behalf. Contributions do not include additions to the Program which: (i) are separate modules of software distributed in conjunction with the Program under their own license agreement, and (ii) are not derivative works of the Program. 
+
+"Contributor" means any person or entity that distributes the Program.
+
+"Licensed Patents " mean patent claims licensable by a Contributor which are necessarily infringed by the use or sale of its Contribution alone or when combined with the Program.
+
+"Program" means the Contributions distributed in accordance with this Agreement.
+
+"Recipient" means anyone who receives the Program under this Agreement, including all Contributors.
+
+2. GRANT OF RIGHTS
+
+      a) Subject to the terms of this Agreement, each Contributor hereby grants Recipient a non-exclusive, worldwide, royalty-free copyright license to reproduce, prepare derivative works of, publicly display, publicly perform, distribute and sublicense the Contribution of such Contributor, if any, and such derivative works, in source code and object code form.
+
+      b) Subject to the terms of this Agreement, each Contributor hereby grants Recipient a non-exclusive, worldwide, royalty-free patent license under Licensed Patents to make, use, sell, offer to sell, import and otherwise transfer the Contribution of such Contributor, if any, in source code and object code form. This patent license shall apply to the combination of the Contribution and the Program if, at the time the Contribution is added by the Contributor, such addition of the Contribution causes such combination to be covered by the Licensed Patents. The patent license shall not apply to any other combinations which include the Contribution. No hardware per se is licensed hereunder. 
+
+      c) Recipient understands that although each Contributor grants the licenses to its Contributions set forth herein, no assurances are provided by any Contributor that the Program does not infringe the patent or other intellectual property rights of any other entity. Each Contributor disclaims any liability to Recipient for claims brought by any other entity based on infringement of intellectual property rights or otherwise. As a condition to exercising the rights and licenses granted hereunder, each Recipient hereby assumes sole responsibility to secure any other intellectual property rights needed, if any. For example, if a third party patent license is required to allow Recipient to distribute the Program, it is Recipient's responsibility to acquire that license before distributing the Program.
+
+      d) Each Contributor represents that to its knowledge it has sufficient copyright rights in its Contribution, if any, to grant the copyright license set forth in this Agreement. 
+
+3. REQUIREMENTS
+
+A Contributor may choose to distribute the Program in object code form under its own license agreement, provided that:
+
+      a) it complies with the terms and conditions of this Agreement; and
+
+      b) its license agreement:
+
+      i) effectively disclaims on behalf of all Contributors all warranties and conditions, express and implied, including warranties or conditions of title and non-infringement, and implied warranties or conditions of merchantability and fitness for a particular purpose; 
+
+      ii) effectively excludes on behalf of all Contributors all liability for damages, including direct, indirect, special, incidental and consequential damages, such as lost profits; 
+
+      iii) states that any provisions which differ from this Agreement are offered by that Contributor alone and not by any other party; and
+
+      iv) states that source code for the Program is available from such Contributor, and informs licensees how to obtain it in a reasonable manner on or through a medium customarily used for software exchange. 
+
+When the Program is made available in source code form:
+
+      a) it must be made available under this Agreement; and 
+
+      b) a copy of this Agreement must be included with each copy of the Program. 
+
+Contributors may not remove or alter any copyright notices contained within the Program.
+
+Each Contributor must identify itself as the originator of its Contribution, if any, in a manner that reasonably allows subsequent Recipients to identify the originator of the Contribution.
+
+4. COMMERCIAL DISTRIBUTION
+
+Commercial distributors of software may accept certain responsibilities with respect to end users, business partners and the like. While this license is intended to facilitate the commercial use of the Program, the Contributor who includes the Program in a commercial product offering should do so in a manner which does not create potential liability for other Contributors. Therefore, if a Contributor includes the Program in a commercial product offering, such Contributor ("Commercial Contributor") hereby agrees to defend and indemnify every other Contributor ("Indemnified Contributor") against any losses, damages and costs (collectively "Losses") arising from claims, lawsuits and other legal actions brought by a third party against the Indemnified Contributor to the extent caused by the acts or omissions of such Commercial Contributor in connection with its distribution of the Program in a commercial product offering. The obligations in this section do not apply to any claims or Losses relating to any actual or alleged intellectual property infringement. In order to qualify, an Indemnified Contributor must: a) promptly notify the Commercial Contributor in writing of such claim, and b) allow the Commercial Contributor to control, and cooperate with the Commercial Contributor in, the defense and any related settlement negotiations. The Indemnified Contributor may participate in any such claim at its own expense.
+
+For example, a Contributor might include the Program in a commercial product offering, Product X. That Contributor is then a Commercial Contributor. If that Commercial Contributor then makes performance claims, or offers warranties related to Product X, those performance claims and warranties are such Commercial Contributor's responsibility alone. Under this section, the Commercial Contributor would have to defend claims against the other Contributors related to those performance claims and warranties, and if a court requires any other Contributor to pay any damages as a result, the Commercial Contributor must pay those damages.
+
+5. NO WARRANTY
+
+EXCEPT AS EXPRESSLY SET FORTH IN THIS AGREEMENT, THE PROGRAM IS PROVIDED ON AN "AS IS" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, EITHER EXPRESS OR IMPLIED INCLUDING, WITHOUT LIMITATION, ANY WARRANTIES OR CONDITIONS OF TITLE, NON-INFRINGEMENT, MERCHANTABILITY OR FITNESS FOR A PARTICULAR PURPOSE. Each Recipient is solely responsible for determining the appropriateness of using and distributing the Program and assumes all risks associated with its exercise of rights under this Agreement, including but not limited to the risks and costs of program errors, compliance with applicable laws, damage to or loss of data, programs or equipment, and unavailability or interruption of operations.
+
+6. DISCLAIMER OF LIABILITY
+
+EXCEPT AS EXPRESSLY SET FORTH IN THIS AGREEMENT, NEITHER RECIPIENT NOR ANY CONTRIBUTORS SHALL HAVE ANY LIABILITY FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING WITHOUT LIMITATION LOST PROFITS), HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OR DISTRIBUTION OF THE PROGRAM OR THE EXERCISE OF ANY RIGHTS GRANTED HEREUNDER, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGES.
+
+7. GENERAL
+
+If any provision of this Agreement is invalid or unenforceable under applicable law, it shall not affect the validity or enforceability of the remainder of the terms of this Agreement, and without further action by the parties hereto, such provision shall be reformed to the minimum extent necessary to make such provision valid and enforceable.
+
+If Recipient institutes patent litigation against a Contributor with respect to a patent applicable to software (including a cross-claim or counterclaim in a lawsuit), then any patent licenses granted by that Contributor to such Recipient under this Agreement shall terminate as of the date such litigation is filed. In addition, if Recipient institutes patent litigation against any entity (including a cross-claim or counterclaim in a lawsuit) alleging that the Program itself (excluding combinations of the Program with other software or hardware) infringes such Recipient's patent(s), then such Recipient's rights granted under Section 2(b) shall terminate as of the date such litigation is filed.
+
+All Recipient's rights under this Agreement shall terminate if it fails to comply with any of the material terms or conditions of this Agreement and does not cure such failure in a reasonable period of time after becoming aware of such noncompliance. If all Recipient's rights under this Agreement terminate, Recipient agrees to cease use and distribution of the Program as soon as reasonably practicable. However, Recipient's obligations under this Agreement and any licenses granted by Recipient relating to the Program shall continue and survive.
+
+Everyone is permitted to copy and distribute copies of this Agreement, but in order to avoid inconsistency the Agreement is copyrighted and may only be modified in the following manner. The Agreement Steward reserves the right to publish new versions (including revisions) of this Agreement from time to time. No one other than the Agreement Steward has the right to modify this Agreement. IBM is the initial Agreement Steward. IBM may assign the responsibility to serve as the Agreement Steward to a suitable separate entity. Each new version of the Agreement will be given a distinguishing version number. The Program (including Contributions) may always be distributed subject to the version of the Agreement under which it was received. In addition, after a new version of the Agreement is published, Contributor may elect to distribute the Program (including its Contributions) under the new version. Except as expressly stated in Sections 2(a) and 2(b) above, Recipient receives no rights or licenses to the intellectual property of any Contributor under this Agreement, whether expressly, by implication, estoppel or otherwise. All rights in the Program not expressly granted under this Agreement are reserved.
+
+This Agreement is governed by the laws of the State of New York and the intellectual property laws of the United States of America. No party to this Agreement will bring a legal action under this Agreement more than one year after the cause of action arose. Each party waives its rights to a jury trial in any resulting litigation. 
+
+SPECIAL EXCEPTION FOR LZMA COMPRESSION MODULE
+---------------------------------------------
+
+Igor Pavlov and Amir Szekely, the authors of the LZMA compression module for NSIS, expressly permit you to statically or dynamically link your code (or bind by name) to the files from the LZMA compression module for NSIS without subjecting your linked code to the terms of the Common Public license version 1.0. Any modifications or additions to files from the LZMA compression module for NSIS, however, are subject to the terms of the Common Public License version 1.0.

Engine/bin/tools/nsis/app/Contrib/Language files/Afrikaans.nlf

@@ -0,0 +1,190 @@
+# Header, don't edit
+NLF v6
+# Language ID
+1078
+# Font and size - dash (-) means default
+-
+-
+# Codepage - dash (-) means ANSI code page
+1252
+# RTL - anything else than RTL means LTR
+-
+# Translation by Friedel Wolff
+# ^Branding
+Nullsoft Installeerstelsel %s
+# ^SetupCaption
+$(^Name) Installasie
+# ^UninstallCaption
+$(^Name) Verwydering
+# ^LicenseSubCaption
+: Lisensie-ooreenkoms
+# ^ComponentsSubCaption
+: Installasiekeuses
+# ^DirSubCaption
+: Installasiegids
+# ^InstallingSubCaption
+: Installeer tans
+# ^CompletedSubCaption
+: Voltooid
+# ^UnComponentsSubCaption
+: Verwyderingkeuses
+# ^UnDirSubCaption
+: Verwyderinggids
+# ^ConfirmSubCaption
+: Bevestiging
+# ^UninstallingSubCaption
+: Verwyder tans
+# ^UnCompletedSubCaption
+: Voltooid
+# ^BackBtn
+< V&orige
+# ^NextBtn
+&Volgende >
+# ^AgreeBtn
+&Regso
+# ^AcceptBtn
+Ek &aanvaar die ooreenkoms
+# ^DontAcceptBtn
+Ek aan vaar &nie die ooreenkoms nie
+# ^InstallBtn
+&Installeer
+# ^UninstallBtn
+&Verwyder
+# ^CancelBtn
+Kanselleer
+# ^CloseBtn
+&Sluit af
+# ^BrowseBtn
+&Blaai...
+# ^ShowDetailsBtn
+&Wys detail
+# ^ClickNext
+Klik op Volgende om verder te gaan.
+# ^ClickInstall
+Klik op Installeer om die installasie te begin.
+# ^ClickUninstall
+Klik op Verwyder om die verwydering te begin.
+# ^Name
+Naam
+# ^Completed
+Voltooid
+# ^LicenseText
+Lees die lisensieooreenkoms voordat u $(^NameDA) installeer. Klik op Regso as u die ooreenkoms aanvaar.
+# ^LicenseTextCB
+Lees die lisensieooreenkoms voordat u $(^NameDA) installeer. Merk die blokkie hieronder as u die ooreenkoms aanvaar. $_CLICK
+# ^LicenseTextRB
+Lees die lisensieooreenkoms voordat u $(^NameDA) installeer. Kies die eerste keuse hieronder as u die ooreenkoms aanvaar. $_CLICK
+# ^UnLicenseText
+Lees die lisensieooreenkoms voordat u $(^NameDA) verwyder. Klik op Regso als u die ooreenkoms aanvaar.
+# ^UnLicenseTextCB
+Lees die lisensieooreenkoms voordat u $(^NameDA) verwyder. Merk die blokkie hieronder as u die ooreenkoms aanvaar. $_CLICK
+# ^UnLicenseTextRB
+Lees die lisensieooreenkoms voordat u $(^NameDA) verwyder. KIes die eerste keuse hieronder as u die ooreenkoms aanvaar. $_CLICK
+# ^Custom
+Aangepast
+# ^ComponentsText
+Kies die komponente wat u wil installeer en deselekteer dié wat u nie wil installeer nie. $_CLICK
+# ^ComponentsSubText1
+Kies die installasietipe:
+# ^ComponentsSubText2_NoInstTypes
+Kies die komponente wat geïnstalleer moet word:
+# ^ComponentsSubText2
+Of kies die komponente wat geïnstalleer moet word:
+# ^UnComponentsText
+Kies die komponente wat u wil verwyder en deselekteer dié wat u nie wil verwyder nie. $_CLICK
+# ^UnComponentsSubText1
+Kies die verwyderingstipe:
+# ^UnComponentsSubText2_NoInstTypes
+Kies die komponente wat verwyder moet word:
+# ^UnComponentsSubText2
+Of kies die komponente wat verwyder moet word:
+# ^DirText
+$(^NameDA) sal in die volgende gids geïnstalleer word. Om elders te installeer, klik op Blaai en kies 'n ander een. $_CLICK
+# ^DirSubText
+Installasiegids
+# ^DirBrowseText
+Kies die gids om $(^NameDA) in te installeer:
+# ^UnDirText
+$(^NameDA) gaan uit die volgende gids verwyder word. Om van elders af te verwyder, klik op Blaai en kies 'n ander gids. $_CLICK
+# ^UnDirSubText
+""
+# ^UnDirBrowseText
+Kies die gids om $(^NameDA) uit te verwyder:
+# ^SpaceAvailable
+"Beskikbare spasie: "
+# ^SpaceRequired
+"Vereiste spasie: "
+# ^UninstallingText
+$(^NameDA) sal uit die volgende gids verwyder word. $_CLICK
+# ^UninstallingSubText
+Verwydering uit:
+# ^FileError
+Fout met skryf na lêer: \r\n\r\n$0\r\n\r\nKlik Staak om de installasie te stop,\r\nProbeer weer om weer te probeer of\r\nIgnoreer om dié lêer oor te slaan.
+# ^FileError_NoIgnore
+Fout met skryf na lêer: \r\n\r\n$0\r\n\r\nKlik Probeer weer om op nuut te probeer, of \r\nKanselleer om die installasie te stop.
+# ^CantWrite
+"Kon nie skyf nie: "
+# ^CopyFailed
+Kopiëring het misluk
+# ^CopyTo
+"Kopieer na "
+# ^Registering
+"Registreer tans: "
+# ^Unregistering
+"Deregistreer tans: "
+# ^SymbolNotFound
+"Kon nie simbool vind nie: "
+# ^CouldNotLoad
+"Kon nie laai nie: "
+# ^CreateFolder
+"Skep gids: "
+# ^CreateShortcut
+"Maak kortpad: "
+# ^CreatedUninstaller
+"Verwyderingsprogram gemaak: "
+# ^Delete
+"Verwyder lêer: "
+# ^DeleteOnReboot
+"Verwyder na herbegin van rekenaar: "
+# ^ErrorCreatingShortcut
+"Fout met maak van kortpad: "
+# ^ErrorCreating
+"Fout met skep: "
+# ^ErrorDecompressing
+Fout met uitpak van data! Korrupte installasielêer?
+# ^ErrorRegistering
+Fout met registrasie van DLL
+# ^ExecShell
+"ExecShell: "
+# ^Exec
+"Voer uit: "
+# ^Extract
+"Pak uit: "
+# ^ErrorWriting
+"Uitpak: fout met skryf na lêer "
+# ^InvalidOpcode
+Installasieprogram korrup: ongeldige opcode
+# ^NoOLE
+"Geen OLE vir: "
+# ^OutputFolder
+"Afvoergids: "
+# ^RemoveFolder
+"Verwyder gids: "
+# ^RenameOnReboot
+"Hernoem na herbegin van rekenaar: "
+# ^Rename
+"Hernoem: "
+# ^Skipped
+"Oorgeslaan: "
+# ^CopyDetails
+Kopieer detail na knipbord
+# ^LogInstall
+Boekstaaf die installasieproses
+# ^Byte
+G
+# ^Kilo
+K
+# ^Mega
+M
+#  ^Giga
+G

Engine/bin/tools/nsis/app/Contrib/Language files/Afrikaans.nsh

@@ -0,0 +1,121 @@
+;Language: Afrikaans (1078)
+;By Friedel Wolff
+
+!insertmacro LANGFILE "Afrikaans" "Afrikaans"
+
+!ifdef MUI_WELCOMEPAGE
+  ${LangFileString} MUI_TEXT_WELCOME_INFO_TITLE "Welkom by die $(^NameDA) Installasieslimmerd"
+  ${LangFileString} MUI_TEXT_WELCOME_INFO_TEXT "Hierdie slimmerd lei mens deur die installasie van $(^NameDA).$\r$\n$\r$\nDit word aanbeveel dat u alle ander programme afsluit voor die begin van die installasie. Dit maak dit moontlik om die relevante stelsellêers op te dateer sonder om die rekenaar te herlaai.$\r$\n$\r$\n$_CLICK"
+!endif
+
+!ifdef MUI_UNWELCOMEPAGE
+  ${LangFileString} MUI_UNTEXT_WELCOME_INFO_TITLE "Welkom by die $(^NameDA) Verwyderingslimmerd"
+  ${LangFileString} MUI_UNTEXT_WELCOME_INFO_TEXT "Hierdie slimmerd lei mens deur die verwydering van $(^NameDA).$\r$\n$\r$\nVoor die verwydering begin word, maak seker dat $(^NameDA) nie loop nie.$\r$\n$\r$\n$_CLICK"
+!endif
+
+!ifdef MUI_LICENSEPAGE
+  ${LangFileString} MUI_TEXT_LICENSE_TITLE "Lisensie-ooreenkoms"
+  ${LangFileString} MUI_TEXT_LICENSE_SUBTITLE "Lees die lisensie-ooreenkoms voordat u $(^NameDA) installeer."
+  ${LangFileString} MUI_INNERTEXT_LICENSE_BOTTOM "Klik op Regso om verder te gaan as u die ooreenkoms aanvaar. U moet die ooreenkoms aanvaar om $(^NameDA) te installeer."
+  ${LangFileString} MUI_INNERTEXT_LICENSE_BOTTOM_CHECKBOX "Merk die blokkie hier onder as u die ooreenkoms aanvaar. U moet die ooreenkoms aanvaar om $(^NameDA) te installeer. $_CLICK"
+  ${LangFileString} MUI_INNERTEXT_LICENSE_BOTTOM_RADIOBUTTONS "Kies die eerste keuse hieronder as u die ooreenkoms aanvaar. U moet die ooreenkoms aanvaar om $(^NameDA) te installeer. $_CLICK"
+!endif
+
+!ifdef MUI_UNLICENSEPAGE
+  ${LangFileString} MUI_UNTEXT_LICENSE_TITLE "Lisensie-ooreenkoms"
+  ${LangFileString} MUI_UNTEXT_LICENSE_SUBTITLE "Lees die lisensie-ooreenkoms voordat u $(^NameDA) verwyder."
+  ${LangFileString} MUI_UNINNERTEXT_LICENSE_BOTTOM "Klik op Regso om verder te gaan as u die ooreenkoms aanvaar. U moet die ooreenkoms aanvaar om $(^NameDA) te verwyder."
+  ${LangFileString} MUI_UNINNERTEXT_LICENSE_BOTTOM_CHECKBOX "Merk die kiesblokkie hieronder as u die ooreenkoms aanvaar. U moet die ooreenkoms aanvaar om $(^NameDA) te verwyder."
+  ${LangFileString} MUI_UNINNERTEXT_LICENSE_BOTTOM_RADIOBUTTONS "Kies die eerste keuse hieronder as u die ooreenkoms aanvaar. U moet die ooreenkoms aanvaar om $(^NameDA) te verwyder."
+!endif
+
+!ifdef MUI_LICENSEPAGE | MUI_UNLICENSEPAGE
+  ${LangFileString} MUI_INNERTEXT_LICENSE_TOP "Druk op Page Down om die res van die ooreenkoms te sien."
+!endif
+
+!ifdef MUI_COMPONENTSPAGE
+  ${LangFileString} MUI_TEXT_COMPONENTS_TITLE "Kies komponente"
+  ${LangFileString} MUI_TEXT_COMPONENTS_SUBTITLE "Kies watter komponente van $(^NameDA) geïnstalleer moet word."
+  ${LangFileString} MUI_INNERTEXT_COMPONENTS_DESCRIPTION_TITLE "Beskrywing"
+!endif
+
+!ifdef MUI_UNCOMPONENTSPAGE
+  ${LangFileString} MUI_UNTEXT_COMPONENTS_TITLE "Kies komponente"
+  ${LangFileString} MUI_UNTEXT_COMPONENTS_SUBTITLE "Kies watter komponente van $(^NameDA) verwyder moet word."
+!endif
+
+!ifdef MUI_COMPONENTSPAGE | MUI_UNCOMPONENTSPAGE
+  !ifndef NSIS_CONFIG_COMPONENTPAGE_ALTERNATIVE
+    ${LangFileString} MUI_INNERTEXT_COMPONENTS_DESCRIPTION_INFO "Beweeg die muis oor 'n komponent om sy beskrywing te sien."
+  !else
+    ${LangFileString} MUI_INNERTEXT_COMPONENTS_DESCRIPTION_INFO "Beweeg die muis oor 'n komponent om sy beskrywing te sien."
+  !endif
+!endif
+
+!ifdef MUI_DIRECTORYPAGE
+  ${LangFileString} MUI_TEXT_DIRECTORY_TITLE "Kies installasieplek"
+  ${LangFileString} MUI_TEXT_DIRECTORY_SUBTITLE "Kies die gids waarin u $(^NameDA) wil installeer."
+!endif
+
+!ifdef MUI_UNDIRECTORYSPAGE
+  ${LangFileString} MUI_UNTEXT_DIRECTORY_TITLE "Kies verwyderinggids"
+  ${LangFileString} MUI_UNTEXT_DIRECTORY_SUBTITLE "Kies die gids waaruit u $(^NameDA) wil verwyder."
+!endif
+
+!ifdef MUI_INSTFILESPAGE
+  ${LangFileString} MUI_TEXT_INSTALLING_TITLE "Installeer tans"
+  ${LangFileString} MUI_TEXT_INSTALLING_SUBTITLE "Wag asb. terwyl $(^NameDA) geïnstalleer word."
+  ${LangFileString} MUI_TEXT_FINISH_TITLE "Installasie voltooid"
+  ${LangFileString} MUI_TEXT_FINISH_SUBTITLE "Die installasie is suksesvol voltooi."
+  ${LangFileString} MUI_TEXT_ABORT_TITLE "Installasie gestaak"
+  ${LangFileString} MUI_TEXT_ABORT_SUBTITLE "Die installasie is nie suksesvol voltooi nie."
+!endif
+
+!ifdef MUI_UNINSTFILESPAGE
+  ${LangFileString} MUI_UNTEXT_UNINSTALLING_TITLE "Verwyder tans"
+  ${LangFileString} MUI_UNTEXT_UNINSTALLING_SUBTITLE "Wag asb. terwyl $(^NameDA) van u rekenaar verwyder word."
+  ${LangFileString} MUI_UNTEXT_FINISH_TITLE "Verwydering voltooi"
+  ${LangFileString} MUI_UNTEXT_FINISH_SUBTITLE "Verwydering is suksesvol voltooi."
+  ${LangFileString} MUI_UNTEXT_ABORT_TITLE "Verwydering gestaak"
+  ${LangFileString} MUI_UNTEXT_ABORT_SUBTITLE "Verwydering is nie suksesvol voltooi nie."
+!endif
+
+!ifdef MUI_FINISHPAGE
+  ${LangFileString} MUI_TEXT_FINISH_INFO_TITLE "Voltooi van die $(^NameDA) Installasieslimmerd"
+  ${LangFileString} MUI_TEXT_FINISH_INFO_TEXT "$(^NameDA) is geïnstalleer op uw rekenaar.$\r$\n$\r$\nKlik op Voltooi om hierdie slimmerd af te sluit."
+  ${LangFileString} MUI_TEXT_FINISH_INFO_REBOOT "Die rekenaar moet oorbegin word om die installasie van $(^NameDA) te voltooi. Wil u nou oorbegin?"
+!endif
+
+!ifdef MUI_UNFINISHPAGE
+  ${LangFileString} MUI_UNTEXT_FINISH_INFO_TITLE "Voltooi van die $(^NameDA) Verwyderingslimmerd"
+  ${LangFileString} MUI_UNTEXT_FINISH_INFO_TEXT "$(^NameDA) is van u rekenaar verwyder.$\r$\n$\r$\nKlik op Voltooi om hierdie slimmerd af te sluit."
+  ${LangFileString} MUI_UNTEXT_FINISH_INFO_REBOOT "Die rekenaar moet oorbegin word om die verwydering van $(^NameDA) te voltooi. Wil u nou oorbegin?"
+!endif
+
+!ifdef MUI_FINISHPAGE | MUI_UNFINISHPAGE
+  ${LangFileString} MUI_TEXT_FINISH_REBOOTNOW "Begin nou oor"
+  ${LangFileString} MUI_TEXT_FINISH_REBOOTLATER "Ek wil later self oorbegin"
+  ${LangFileString} MUI_TEXT_FINISH_RUN "&Laat loop $(^NameDA)"
+  ${LangFileString} MUI_TEXT_FINISH_SHOWREADME "&Wys Leesmy-lêer"
+  ${LangFileString} MUI_BUTTONTEXT_FINISH "&Voltooi"  
+!endif
+
+!ifdef MUI_STARTMENUPAGE
+  ${LangFileString} MUI_TEXT_STARTMENU_TITLE "Kies gids in Begin-kieslys"
+  ${LangFileString} MUI_TEXT_STARTMENU_SUBTITLE "Kies 'n gids in die Begin-kieslys vir $(^NameDA) se kortpaaie."
+  ${LangFileString} MUI_INNERTEXT_STARTMENU_TOP "Kies die gids in die Begin-kieslys waarin die program se kortpaaie geskep moet word. U kan ook 'n nuwe naam gee om 'n nuwe gids te skep."
+  ${LangFileString} MUI_INNERTEXT_STARTMENU_CHECKBOX "Moenie kortpaaie maak nie"
+!endif
+
+!ifdef MUI_UNCONFIRMPAGE
+  ${LangFileString} MUI_UNTEXT_CONFIRM_TITLE "Verwyder $(^NameDA)"
+  ${LangFileString} MUI_UNTEXT_CONFIRM_SUBTITLE "Verwyder $(^NameDA) van u rekenaar."
+!endif
+
+!ifdef MUI_ABORTWARNING
+  ${LangFileString} MUI_TEXT_ABORTWARNING "Wil u definitief die installasie van $(^Name) afsluit?"
+!endif
+
+!ifdef MUI_UNABORTWARNING
+  ${LangFileString} MUI_UNTEXT_ABORTWARNING "Wil u definitief die verwydering van $(^Name) afsluit?"
+!endif

Engine/bin/tools/nsis/app/Contrib/Language files/Albanian.nlf

@@ -0,0 +1,191 @@
+# Header, don't edit
+NLF v6
+# Start editing here
+# Language ID
+1052
+# Font and size - dash (-) means default
+-
+-
+# Codepage - dash (-) means ANSI code page
+1250
+# RTL - anything else than RTL means LTR
+-
+# Përkthimi nga Besnik Bleta, [email protected]
+# ^Branding
+Sistemi Nullsoft për Instalime %s
+# ^SetupCaption
+Rregullimi i $(^Name)
+# ^UninstallCaption
+Çinstalimi i $(^Name)
+# ^LicenseSubCaption
+: Marrëveshje Licence
+# ^ComponentsSubCaption
+: Mundësi Instalimi
+# ^DirSubCaption
+: Dosje Instalimi
+# ^InstallingSubCaption
+: Po instalohet
+# ^CompletedSubCaption
+: U plotësua
+# ^UnComponentsSubCaption
+: Mundësi Çinstalimi
+# ^UnDirSubCaption
+: Dosje Çinstalimi
+# ^ConfirmSubCaption
+: Ripohim
+# ^UninstallingSubCaption
+: Po çinstalohet
+# ^UnCompletedSubCaption
+: U plotësua
+# ^BackBtn
+< &Mbrapsht
+# ^NextBtn
+&Tjetri >
+# ^AgreeBtn
+&Pajtohem
+# ^AcceptBtn
+&I pranoj kushtet e Marrëveshjes së Licensës
+# ^DontAcceptBtn
+&Nuk i pranoj kushtet e Marrëveshjes së Licensës
+# ^InstallBtn
+&Instaloje
+# ^UninstallBtn
+&Çinstaloje
+# ^CancelBtn
+Anuloje
+# ^CloseBtn
+&Mbylle
+# ^BrowseBtn
+Sh&fletoni...
+# ^ShowDetailsBtn
+Shfaq &hollësi
+# ^ClickNext
+Klikoni Tjetri për të vazhduar.
+# ^ClickInstall
+Për të filluar instalimin klikoni Instaloje.
+# ^ClickUninstall
+Për të filluar çinstalimin klikoni Çinstaloje.
+# ^Name
+Emër
+# ^Completed
+U plotësua
+# ^LicenseText
+Ju lutem, para instalimit të $(^NameDA), shqyrtoni marrëveshjen e licencës. Nëse i pranoni tërë kushtet e marrëveshjes, klikoni Pajtohem.
+# ^LicenseTextCB
+Ju lutem, para instalimit të $(^NameDA), shqyrtoni marrëveshjen e licensës. Nëse i pranoni tërë kushtet e marrëveshjes, klikoni kutizën më poshtë. $_CLICK
+# ^LicenseTextRB
+Ju lutem, para instalimit të $(^NameDA), shqyrtoni marrëveshjen e licensës. Nëse i pranoni tërë kushtet e marrëveshjes, përzgjidhni mundësinë e parë më poshtë. $_CLICK
+# ^UnLicenseText
+Ju lutem, para çinstalimit të $(^NameDA), shqyrtoni marrëveshjen e licensës. Nëse i pranoni tërë kushtet e marrëveshjes, klikoni Pajtohem.
+# ^UnLicenseTextCB
+Ju lutem, para çinstalimit të $(^NameDA), shqyrtoni marrëveshjen e licensës. Nëse i pranoni tërë kushtet e marrëveshjes, klikoni kutizën më poshtë. $_CLICK
+# ^UnLicenseTextRB
+Ju lutem, para çinstalimit të $(^NameDA), shqyrtoni marrëveshjen e licensës. Nëse i pranoni tërë kushtet e marrëveshjes, përzgjidhni mundësinë e parë më poshtë. $_CLICK
+# ^Custom
+Vetjake
+# ^ComponentsText
+U vini shenjë përbërësve që doni të instalohen dhe hiquani shenjën  përbërësvet që nuk doni të instalohen. $_CLICK
+# ^ComponentsSubText1
+Përzgjidhni llojin e instalimit:
+# ^ComponentsSubText2_NoInstTypes
+Përzgjidhni përbërësit për instalim:
+# ^ComponentsSubText2
+Ose, përzgjidhni përbërësit e mundshëm që doni të instalohen:
+# ^UnComponentsText
+U vini shenjë përbërësve që doni të çinstalohen dhe hiquni shenjën përbërësve që nuk doni të çinstalohen. $_CLICK
+# ^UnComponentsSubText1
+Përzgjidhni llojin e çinstalimit:
+# ^UnComponentsSubText2_NoInstTypes
+Përzgjidhni përbërësit për çinstalim:
+# ^UnComponentsSubText2
+Ose, përzgjidhni përbërësit e mundshëm që doni të çinstalohen:
+# ^DirText
+Rregullimi do ta instalojë $(^NameDA) në dosjen vijuese. Për instalim në një dosje tjetër, klikoni Shfletoni dhe përzgjidhni një tjetër dosje. $_CLICK
+# ^DirSubText
+Dosje Vendmbërritje
+# ^DirBrowseText
+Përzgjidhni dosjen ku të instalohet $(^NameDA):
+# ^UnDirText
+Rregullimi do të çinstalojë $(^NameDA) prej dosjes vijuese. Për çinstalim prej një dosjeje tjetër, klikoni Shfletoni dhe përzgjidhni një tjetër dosje. $_CLICK
+# ^UnDirSubText
+""
+# ^UnDirBrowseText
+Përzgjidhni dosjen prej nga ku të çinstalohet $(^NameDA):
+# ^SpaceAvailable
+"Hapësirë e mundshme: "
+# ^SpaceRequired
+"Hapësirë e nevojshme: "
+# ^UninstallingText
+$(^NameDA) do të çinstalohet prej dosjes vijuese. $_CLICK
+# ^UninstallingSubText
+Po çinstalohet prej:
+# ^FileError
+Gabim në hapje kartele për shkrim: \r\n\r\n$0\r\n\r\nKlikoni Ndërprite për të ndalur instalimin,\r\nRiprovo për të provuar sërish, ose\r\nShpërfille për të sanashkaluar këtë kartelë.
+# ^FileError_NoIgnore
+Gabim në hapje kartele për shkrim: \r\n\r\n$0\r\n\r\nKlikoni Riprovo për të provuar sërish, ose\r\nAnulo për të ndalur instalimin.
+# ^CantWrite
+"S'shkruaj dot: "
+# ^CopyFailed
+Kopjimi dështoi
+# ^CopyTo
+"Kopjo tek "
+# ^Registering
+"Regjistrim: "
+# ^Unregistering
+"Çregjistrim: "
+# ^SymbolNotFound
+"S'u gjet dot simbol: "
+# ^CouldNotLoad
+"S'u ngarkua dot: "
+# ^CreateFolder
+"Krijo dosje: "
+# ^CreateShortcut
+"Krijo shkurtore: "
+# ^CreatedUninstaller
+"Krijo çinstalues: "
+# ^Delete
+"Fshi kartelë: "
+# ^DeleteOnReboot
+"Fshi gjatë rinisjes: "
+# ^ErrorCreatingShortcut
+"Gabim në krijim shkurtoresh: "
+# ^ErrorCreating
+"Gabim në krijimin e: "
+# ^ErrorDecompressing
+Gabim në çngjeshje të dhënash! Instalues i dëmtuar?
+# ^ErrorRegistering
+Gabim në regjistrim DLL-je
+# ^ExecShell
+"ExecShell: "
+# ^Exec
+"Ekzekuto: "
+# ^Extract
+"Përfto: "
+# ^ErrorWriting
+"Përftim: gabim në shkrim te kartela "
+# ^InvalidOpcode
+Instalues i dëmtuar: opcode i pavlefshëm
+# ^NoOLE
+"Pa OLE për: "
+# ^OutputFolder
+"Dosje përfundimesh: "
+# ^RemoveFolder
+"Hiq dosjen: "
+# ^RenameOnReboot
+"Riemërtoje gjatë rinisjes: "
+# ^Rename
+"Riemërtoje: "
+# ^Skipped
+"U anashkalua: "
+# ^CopyDetails
+Kopjo Hollësira Te Clipboard
+# ^LogInstall
+Regjistro procesin e instalimit
+# ^Byte
+B
+# ^Kilo
+K
+# ^Mega
+M
+# ^Giga
+G

Engine/bin/tools/nsis/app/Contrib/Language files/Albanian.nsh

@@ -0,0 +1,129 @@
+;Language: Albanian (1052)
+;Translation Besnik Bleta, [email protected]
+
+!insertmacro LANGFILE "Albanian" "Albanian"
+
+!ifdef MUI_WELCOMEPAGE
+  ${LangFileString} MUI_TEXT_WELCOME_INFO_TITLE "Mirësevini te Rregullimi i $(^NameDA)"
+  ${LangFileString} MUI_TEXT_WELCOME_INFO_TEXT "Ky do t'ju udhëheqë gjatë instalimit të $(^NameDA).$\r$\n$\r$\nKëshillohet që të mbyllni tërë zbatimet e tjera para se të nisni Rregullimin. Kjo bën të mundur përditësimin e kartelave të rëndësishme të sistemit pa u dashur të riniset kompjuteri juaj.$\r$\n$\r$\n$_CLICK"
+!endif
+
+!ifdef MUI_UNWELCOMEPAGE
+  ${LangFileString} MUI_UNTEXT_WELCOME_INFO_TITLE "Mirësevini te Çinstalimi i $(^NameDA)"
+  ${LangFileString} MUI_UNTEXT_WELCOME_INFO_TEXT "Ky do t'ju udhëheqë gjatë çinstalimit të $(^NameDA).$\r$\n$\r$\nPara nisjes së çinstalimit, sigurohuni që $(^NameDA) nuk është duke xhiruar.$\r$\n$\r$\n$_CLICK"
+!endif
+
+!ifdef MUI_LICENSEPAGE
+  ${LangFileString} MUI_TEXT_LICENSE_TITLE "Marrëveshje Licence"
+  ${LangFileString} MUI_TEXT_LICENSE_SUBTITLE "Ju lutem shqyrtoni kushtet e licencës përpara se të instaloni $(^NameDA)."
+  ${LangFileString} MUI_INNERTEXT_LICENSE_BOTTOM "Nëse i pranoni kushtet e marrëveshjes, klikoni Pajtohem për të vazhduar. Duhet ta pranoni marrëveshjen për të instaluar $(^NameDA)."
+  ${LangFileString} MUI_INNERTEXT_LICENSE_BOTTOM_CHECKBOX "Nëse pranoni kushtet e marrëveshjes, klikoni kutizën më poshtë. Duhet të pranoni marrëveshjen për të instaluar $(^NameDA). $_CLICK"
+  ${LangFileString} MUI_INNERTEXT_LICENSE_BOTTOM_RADIOBUTTONS "Nëse pranoni kushtet e marrëveshjes, përzgjidhni më poshtë mundësinë e parë. Duhet të pranoni marrëveshjen për të instaluar $(^NameDA). $_CLICK"
+!endif
+
+!ifdef MUI_UNLICENSEPAGE
+  ${LangFileString} MUI_UNTEXT_LICENSE_TITLE "Marrëveshje Licence"
+  ${LangFileString} MUI_UNTEXT_LICENSE_SUBTITLE "Ju lutem shqyrtoni kushtet e licencës përpara çinstalimit të $(^NameDA)."
+  ${LangFileString} MUI_UNINNERTEXT_LICENSE_BOTTOM "Nëse i pranoni kushtet e marrëveshjes, klikoni Pajtohem për të vazhduar. Duhet të pranoni marrëveshjen për të çinstaluar $(^NameDA)."
+  ${LangFileString} MUI_UNINNERTEXT_LICENSE_BOTTOM_CHECKBOX "Nëse pranoni kushtet e marrëveshjes, klikoni kutizën më poshtë. Duhet të pranoni marrëveshjen për të çinstaluar $(^NameDA). $_CLICK"
+  ${LangFileString} MUI_UNINNERTEXT_LICENSE_BOTTOM_RADIOBUTTONS "Nëse pranoni kushtet e marrëveshjes, përzgjidhni mundësinë e parë më poshtë. Duhet të pranoni marrëveshjen për të çinstaluar $(^NameDA). $_CLICK"
+!endif
+
+!ifdef MUI_LICENSEPAGE | MUI_UNLICENSEPAGE
+  ${LangFileString} MUI_INNERTEXT_LICENSE_TOP "Shtypni Page Down për të parë pjesën e mbetur të marrëveshjes."
+!endif
+
+!ifdef MUI_COMPONENTSPAGE
+  ${LangFileString} MUI_TEXT_COMPONENTS_TITLE "Përzgjidhni Përbërës"
+  ${LangFileString} MUI_TEXT_COMPONENTS_SUBTITLE "Zgjidhni cilat anë të $(^NameDA) doni të instalohen."
+  ${LangFileString} MUI_INNERTEXT_COMPONENTS_DESCRIPTION_TITLE "Përshkrim"
+!endif
+
+!ifdef MUI_UNCOMPONENTSPAGE
+  ${LangFileString} MUI_UNTEXT_COMPONENTS_TITLE "Zgjidhni Përbërësa"
+  ${LangFileString} MUI_UNTEXT_COMPONENTS_SUBTITLE "Zgjidhni cilat anë të $(^NameDA) doni të çinstalohen."
+!endif
+
+!ifdef MUI_COMPONENTSPAGE | MUI_UNCOMPONENTSPAGE
+  !ifndef NSIS_CONFIG_COMPONENTPAGE_ALTERNATIVE
+    ${LangFileString} MUI_INNERTEXT_COMPONENTS_DESCRIPTION_INFO "Për të parë përshkrimin e një përbërësi, vendosni miun përsipër tij."
+  !else
+    ${LangFileString} MUI_INNERTEXT_COMPONENTS_DESCRIPTION_INFO "Për të parë përshkrimin e një përbërësi, vendosni miun përsipër tij."
+  !endif
+!endif
+
+!ifdef MUI_DIRECTORYPAGE
+  ${LangFileString} MUI_TEXT_DIRECTORY_TITLE "Zgjidhni Vend Instalimi"
+  ${LangFileString} MUI_TEXT_DIRECTORY_SUBTITLE "Zgjidhni dosjen tek e cila të instalohet $(^NameDA)."
+!endif
+
+!ifdef MUI_UNDIRECTORYSPAGE
+  ${LangFileString} MUI_UNTEXT_DIRECTORY_TITLE "Zgjidhni Vend Çinstalimi"
+  ${LangFileString} MUI_UNTEXT_DIRECTORY_SUBTITLE "Zgjidhni dosjen prej së cilës të çinstalohet $(^NameDA)."
+!endif
+
+!ifdef MUI_INSTFILESPAGE
+  ${LangFileString} MUI_TEXT_INSTALLING_TITLE "Po instalohet"
+  ${LangFileString} MUI_TEXT_INSTALLING_SUBTITLE "Ju lutem prisni ndërkohë që $(^NameDA) instalohet."
+  ${LangFileString} MUI_TEXT_FINISH_TITLE "Instalim i Plotësuar"
+  ${LangFileString} MUI_TEXT_FINISH_SUBTITLE "Rregullimi u plotësua me sukses."
+  ${LangFileString} MUI_TEXT_ABORT_TITLE "Instalimi u Ndërpre"
+  ${LangFileString} MUI_TEXT_ABORT_SUBTITLE "Rregullimi nuk u plotësua me sukses."
+!endif
+
+!ifdef MUI_UNINSTFILESPAGE
+  ${LangFileString} MUI_UNTEXT_UNINSTALLING_TITLE "Çinstalim"
+  ${LangFileString} MUI_UNTEXT_UNINSTALLING_SUBTITLE "Ju lutem prisni ndërsa $(^NameDA) çinstalohet."
+  ${LangFileString} MUI_UNTEXT_FINISH_TITLE "Çinstalim i Plotë"
+  ${LangFileString} MUI_UNTEXT_FINISH_SUBTITLE "Çinstalimi u plotësua me sukses."
+  ${LangFileString} MUI_UNTEXT_ABORT_TITLE "Çinstalimi u Ndërpre"
+  ${LangFileString} MUI_UNTEXT_ABORT_SUBTITLE "Çinstalimi nuk plotësua me sukses."
+!endif
+
+!ifdef MUI_FINISHPAGE
+  ${LangFileString} MUI_TEXT_FINISH_INFO_TITLE "Po plotësoj Rregullimin e $(^NameDA)"
+  ${LangFileString} MUI_TEXT_FINISH_INFO_TEXT "$(^NameDA) u instalua në kompjuterin tuaj.$\r$\n$\r$\nPër mbylljen e procesit, klikoni Përfundoje."
+  ${LangFileString} MUI_TEXT_FINISH_INFO_REBOOT "Që të mund të plotësohet instalimi i $(^NameDA) kompjuteri juaj duhet të riniset. Doni ta rinisni tani?"
+!endif
+
+!ifdef MUI_UNFINISHPAGE
+  ${LangFileString} MUI_UNTEXT_FINISH_INFO_TITLE "Po plotësoj Çinstalimin e $(^NameDA)"
+  ${LangFileString} MUI_UNTEXT_FINISH_INFO_TEXT "$(^NameDA) u çinstalua prej kompjuterit tuaj.$\r$\n$\r$\nPër mbylljen e procesit, klikoni Përfundoje."
+  ${LangFileString} MUI_UNTEXT_FINISH_INFO_REBOOT "Kompjuteri juaj duhet të riniset që të mund të plotësohet çinstalimi i $(^NameDA). Doni ta rinisni tani?"
+!endif
+
+!ifdef MUI_FINISHPAGE | MUI_UNFINISHPAGE
+  ${LangFileString} MUI_TEXT_FINISH_REBOOTNOW "Rinise tani"
+  ${LangFileString} MUI_TEXT_FINISH_REBOOTLATER "Dua ta rinis dorazi më vonë"
+  ${LangFileString} MUI_TEXT_FINISH_RUN "&Nis $(^NameDA)"
+  ${LangFileString} MUI_TEXT_FINISH_SHOWREADME "&Shfaq Readme"
+  ${LangFileString} MUI_BUTTONTEXT_FINISH "&Përfundoje"  
+!endif
+
+!ifdef MUI_STARTMENUPAGE
+  ${LangFileString} MUI_TEXT_STARTMENU_TITLE "Zgjidhni Dosje Menuje Start"
+  ${LangFileString} MUI_TEXT_STARTMENU_SUBTITLE "Zgjidhni një dosje Menuje Start për shkurtore $(^NameDA)."
+  ${LangFileString} MUI_INNERTEXT_STARTMENU_TOP "Përzgjidhni dosjen e Menusë Start në të cilën do të donit të krijonit shkurtoret për programin. Mundeni edhe të jepni një emër për të krijuar një dosje të re."
+  ${LangFileString} MUI_INNERTEXT_STARTMENU_CHECKBOX "Mos krijo shkurtore"
+!endif
+
+!ifdef MUI_UNCONFIRMPAGE
+  ${LangFileString} MUI_UNTEXT_CONFIRM_TITLE "Çinstalo $(^NameDA)"
+  ${LangFileString} MUI_UNTEXT_CONFIRM_SUBTITLE "Hiqeni $(^NameDA) prej kompjuterit tuaj."
+!endif
+
+!ifdef MUI_ABORTWARNING
+  ${LangFileString} MUI_TEXT_ABORTWARNING "Jeni i sigurt që doni të dilni nga Rregullimi i $(^Name)?"
+!endif
+
+!ifdef MUI_UNABORTWARNING
+  ${LangFileString} MUI_UNTEXT_ABORTWARNING "Jeni i sigurt që doni të dilni nga Çinstalimi i $(^Name)?"
+!endif
+
+!ifdef MULTIUSER_INSTALLMODEPAGE
+  ${LangFileString} MULTIUSER_TEXT_INSTALLMODE_TITLE "Zgjidhni Përdoruesa"
+  ${LangFileString} MULTIUSER_TEXT_INSTALLMODE_SUBTITLE "Zgjidhni për cilët përdoruesa doni të instalohet $(^NameDA)."
+  ${LangFileString} MULTIUSER_INNERTEXT_INSTALLMODE_TOP "Përzgjidhni në doni të instalohet $(^NameDA) vetëm për veten tuaj apo për tërë përdoruesit e këtij kompjuteri. $(^ClickNext)"
+  ${LangFileString} MULTIUSER_INNERTEXT_INSTALLMODE_ALLUSERS "Instaloje për këdo në këtë kompjuter"
+  ${LangFileString} MULTIUSER_INNERTEXT_INSTALLMODE_CURRENTUSER "Instaloje vetëm për mua"
+!endif

Engine/bin/tools/nsis/app/Contrib/Language files/Arabic.nlf

@@ -0,0 +1,190 @@
+# Header, don't edit
+NLF v6
+# Language ID
+1025
+# Font and size - dash (-) means default
+-
+-
+# Codepage - dash (-) means ANSI code page
+1256
+# RTL - anything else than RTL means LTR
+RTL
+# Translation by [email protected], updated by Rami Kattan
+# ^Branding
+نظام التنصيب نلسوفت %s
+# ^SetupCaption
+تنصيب $(^Name)
+# ^UninstallCaption
+إزالة $(^Name)
+# ^LicenseSubCaption
+إتفاقية‏ الترخيص :
+# ^ComponentsSubCaption
+خيارات التنصيب :
+# ^DirSubCaption
+مجلد التنصيب :
+# ^InstallingSubCaption
+تنصيب :
+# ^CompletedSubCaption
+إنتهى :
+# ^UnComponentsSubCaption
+خيارات الإزالة :
+# ^UnDirSubCaption
+مجلد الإزالة :
+# ^ConfirmSubCaption
+تأكيد :
+# ^UninstallingSubCaption
+إزالة :
+# ^UnCompletedSubCaption
+إنتهى :
+# ^BackBtn
+< ال&سابق
+# ^NextBtn
+ال&تالي >
+# ^AgreeBtn
+موافق&
+# ^AcceptBtn
+&أوافق على شروط اتفاقية الترخيص
+# ^DontAcceptBtn
+&لا أوافق على شروط اتفاقية الترخيص
+# ^InstallBtn
+&تنصيب
+# ^UninstallBtn
+&إزالة
+# ^CancelBtn
+إلغاء
+# ^CloseBtn
+إ&غلاق
+# ^BrowseBtn
+&عرض...
+# ^ShowDetailsBtn
+إ&ظهار التفاصيل
+# ^ClickNext
+إضغط على التالي للمتابعة.
+# ^ClickInstall
+إضغط على تنصيب لتشغيل التنصيب.
+# ^ClickUninstall
+إضغط على إزالة لتشغيل الإزالة.
+# ^Name
+الإسم
+# ^Completed
+إنتهى
+# ^LicenseText
+الرجاء مراجعة إتفاقية الترخيص قبل تنصيب $(^NameDA). عند الموافقة على جميع شروط الإتفاقية، إضغط موافق.
+# ^LicenseTextCB
+الرجاء مراجعة إتفاقية الترخيص قبل تنصيب $(^NameDA). عند الموافقة على جميع شروط الإتفاقية، إضغط على مربع المؤشر التالي. $_CLICK.
+# ^LicenseTextRB
+الرجاء مراجعة إتفاقية الترخيص قبل تنصيب $(^NameDA). عند الموافقة على جميع شروط الإتفاقية، إختر الخيار الأول التالي. $_CLICK
+# ^UnLicenseText
+الرجاء مراجعة إتفاقية الترخيص قبل إزالة $(^NameDA). عند الموافقة على جميع شروط الإتفاقية، إضغط موافق.
+# ^UnLicenseTextCB
+الرجاء مراجعة إتفاقية الترخيص قبل إزالة $(^NameDA). عند الموافقة على جميع شروط الإتفاقية، اضغط على مربع المؤشر التالي. $_CLICK
+# ^UnLicenseTextRB
+الرجاء مراجعة إتفاقية الترخيص قبل إزالة $(^NameDA). عند الموافقة على جميع شروط الإتفاقية، إختر الخيار الأول التالي. $_CLICK
+# ^Custom
+إختياري
+# ^ComponentsText
+علّم المكونات المراد تنصيبها وإزل العلامة عن المكونات الغير مراد تنصيبها. $_CLICK
+# ^ComponentsSubText1
+إختر نوع التنصيب:
+# ^ComponentsSubText2_NoInstTypes
+إختر المكونات للتنصيب:
+# ^ComponentsSubText2
+أو، قم بإختيار المكونات الإختيارية المراد تنصيبها:
+# ^UnComponentsText
+علّم المكونات المراد إزالتها وأزل العلامة عن المكونات الغير مراد إزالتها. $_CLICK
+# ^UnComponentsSubText1
+إختر نوع الإزالة:
+# ^UnComponentsSubText2_NoInstTypes
+إختر المكونات للإزالة:
+# ^UnComponentsSubText2
+أو، إختر المكونات الإختيارية المراد إزالتها:
+# ^DirText
+سيتم تنصيب $(^NameDA) في المجلد التالي. للتنصيب في مجلد آخر، إضغط عرض وإختر مجلد آخر. $_CLICK
+# ^DirSubText
+مجلد الهدف
+# ^DirBrowseText
+إختر المجلد لتنصيب $(^NameDA) فيه:
+# ^UnDirText
+سيتم إزالة $(^NameDA) من المجلد التالي. للإزالة من مجلد آخر، إضغط عرض وأختر مجلد آخر. $_CLICK
+# ^UnDirSubText
+""
+# ^UnDirBrowseText
+إختر المجلد لإزالة $(^NameDA) منه:
+# ^SpaceAvailable
+"المساحة المتوفرة: "
+# ^SpaceRequired
+"المساحة المطلوبة: "
+# ^UninstallingText
+سيتم إزالة $(^NameDA) من المجلد التالي. $_CLICK
+# ^UninstallingSubText
+إزالة من:
+# ^FileError
+حدث خلل أثناء فتح ملف للكتابة: \r\n\t\"$0\"\r\nإضغط إلغاء لإلغاء التنصيب،\r\nمحاولة لإعادة محاولة كتابة الملف،\r\n تجاهل لتخطي الملف
+# ^FileError_NoIgnore
+حدث خلل أثناء فتح ملف للكتابة: \r\n\t\"$0\"\r\nإضغط محاولة لإعادة محاولة كتابة الملف، أو\r\nإلغاء لإلغاء التنصيب
+# ^CantWrite
+"لا يستطيع الكتابة: "
+# ^CopyFailed
+فشل النسخ
+# ^CopyTo
+"نسخ إلى"
+# ^Registering
+"تسجيل: "
+# ^Unregistering
+"إلغاء تسجيل: "
+# ^SymbolNotFound
+"لم يتمكن من إيجاد الرمز :"
+# ^CouldNotLoad
+"لم يتمكن من تحميل :"
+# ^CreateFolder
+"إنشاء مجلد"
+# ^CreateShortcut
+"إنشاء إختصار: "
+# ^CreatedUninstaller
+"إنشاء مزيل: "
+# ^Delete
+"حذف ملف: "
+# ^DeleteOnReboot
+"حذف بعد إعادة التشغيل: "
+# ^ErrorCreatingShortcut
+"خلل أثناء إنشاء إختصار: "
+# ^ErrorCreating
+"خلل أثناء إنشاء :"
+# ^ErrorDecompressing
+خلل أثناء فتح البيانات المضغوطة! منصب تالف؟
+# ^ErrorRegistering
+خلل أثناء تسجيل DLL
+# ^ExecShell
+"تنفيذ ExecShell:"
+# ^Exec
+"تنفيذ: "
+# ^Extract
+"إستخراج: "
+# ^ErrorWriting
+"إستخراج: خلل أثناء الكتابة إلى ملف "
+# ^InvalidOpcode
+المنصّب تالف: شفرة غير صالحة
+# ^NoOLE
+"لا توجد OLE لـِ: "
+# ^OutputFolder
+"مجلد الإخراج: "
+# ^RemoveFolder
+"إزالة مجلد: "
+# ^RenameOnReboot
+"إعادة تسمية بعد إعادة التشغيل: "
+# ^Rename
+"إعادة تسمية: "
+# ^Skipped
+"تخطى: "
+# ^CopyDetails
+نسخ التفاصيل إلى الذاكرة
+# ^LogInstall
+سجّل عملية التنصيب
+# ^Byte
+بايت
+# ^Kilo
+كيلو
+# ^Mega
+ميغا
+# ^Giga
+جيغا

Engine/bin/tools/nsis/app/Contrib/Language files/Arabic.nsh

@@ -0,0 +1,122 @@
+;Language: Arabic (1025)
+;Translation by [email protected]
+;updated by Rami Kattan
+
+!insertmacro LANGFILE "Arabic" "Arabic"
+
+!ifdef MUI_WELCOMEPAGE
+  ${LangFileString} MUI_TEXT_WELCOME_INFO_TITLE "مرحبا بك في مرشد إعداد $(^NameDA)"
+  ${LangFileString} MUI_TEXT_WELCOME_INFO_TEXT "سيساعدك هذا المرشد في تنصيب $(^NameDA).$\r$\n$\r$\nمن المفضل إغلاق جميع البرامج قبل التنصيب. سيساعد هذا في تجديد ملفات النظام دون الحاجة لإعادة تشغيل الجهاز.$\r$\n$\r$\n$_CLICK"
+!endif
+
+!ifdef MUI_UNWELCOMEPAGE
+  ${LangFileString} MUI_UNTEXT_WELCOME_INFO_TITLE "مرحبا بك في مرشد إزالة $(^NameDA) "
+  ${LangFileString} MUI_UNTEXT_WELCOME_INFO_TEXT "هذا المرشد سيدلّك أثناء إزالة $(^NameDA).$\r$\n$\r$\n قبل البدء بالإزالة، يرجى التأكد من أن $(^NameDA) غير شغّال.$\r$\n$\r$\n$_CLICK"
+!endif
+
+!ifdef MUI_LICENSEPAGE
+  ${LangFileString} MUI_TEXT_LICENSE_TITLE "إتفاقية‏ الترخيص"
+  ${LangFileString} MUI_TEXT_LICENSE_SUBTITLE "الرجاء مراجعة إتفاقية‏ الترخيص قبل تنصيب $(^NameDA)."
+  ${LangFileString} MUI_INNERTEXT_LICENSE_BOTTOM "عند الموافقة على شروط الإتفاقية‏، إضغط أوافق للمتابعة. يجب الموافقة على الإتفاقية‏ لتنصيب $(^NameDA)."
+  ${LangFileString} MUI_INNERTEXT_LICENSE_BOTTOM_CHECKBOX "عند الموافقة على شروط الإتفاقية‏، علّم مربع العلامة التالي. يجب الموافقة على الإتفاقية‏ لتنصيب $(^NameDA). $_CLICK"
+  ${LangFileString} MUI_INNERTEXT_LICENSE_BOTTOM_RADIOBUTTONS "عند الموافقة على شروط الإتفاقية، إختر الخيار الأول من التالي. يجب الموافقة على الإتفاقية لتنصيب $(^NameDA). $_CLICK"
+!endif
+
+!ifdef MUI_UNLICENSEPAGE
+  ${LangFileString} MUI_UNTEXT_LICENSE_TITLE "إتفاقية الترخيص"
+  ${LangFileString} MUI_UNTEXT_LICENSE_SUBTITLE "الرجاء مراجعة شروط الترخيص قبل إزالة $(^NameDA)."
+  ${LangFileString} MUI_UNINNERTEXT_LICENSE_BOTTOM "عند الموافقة على شروط الإتفاقية، إضغط على موافق. يجب الموافقة على الإتفاقية لإزالة $(^NameDA)."
+  ${LangFileString} MUI_UNINNERTEXT_LICENSE_BOTTOM_CHECKBOX "عند الموافقة على شروط الإتفاقية، علّم المربع العلامة التالي. يجب الموافقة على الإتفاقية لإزالة $(^NameDA). $_CLICK"
+  ${LangFileString} MUI_UNINNERTEXT_LICENSE_BOTTOM_RADIOBUTTONS "عند الموافقة على شروط الإتفاقية، إختر الخيار الأول من التالي. يجب الموافقة على الإتفاقية لإزالة $(^NameDA). $_CLICK"
+!endif
+
+!ifdef MUI_LICENSEPAGE | MUI_UNLICENSEPAGE
+  ${LangFileString} MUI_INNERTEXT_LICENSE_TOP "إضعط مفتاح صفحة للأسفل لرؤية باقي الإتفاقية"
+!endif
+
+!ifdef MUI_COMPONENTSPAGE
+  ${LangFileString} MUI_TEXT_COMPONENTS_TITLE "إختر المكونات"
+  ${LangFileString} MUI_TEXT_COMPONENTS_SUBTITLE "إختر ميزات $(^NameDA) المراد تنصيبها."
+  ${LangFileString} MUI_INNERTEXT_COMPONENTS_DESCRIPTION_TITLE "الوصف"
+!endif
+
+!ifdef MUI_UNCOMPONENTSPAGE
+  ${LangFileString} MUI_UNTEXT_COMPONENTS_TITLE "إختر المكونات"
+  ${LangFileString} MUI_UNTEXT_COMPONENTS_SUBTITLE "إختر ميزات $(^NameDA) المراد إزالتها."
+!endif
+
+!ifdef MUI_COMPONENTSPAGE | MUI_UNCOMPONENTSPAGE
+  !ifndef NSIS_CONFIG_COMPONENTPAGE_ALTERNATIVE
+    ${LangFileString} MUI_INNERTEXT_COMPONENTS_DESCRIPTION_INFO "أشر بالفأرة فوق أحد المكونات لرؤية الوصف"
+  !else
+    ${LangFileString} MUI_INNERTEXT_COMPONENTS_DESCRIPTION_INFO "أشر بالفأرة فوق أحد المكونات لرؤية الوصف"
+  !endif
+!endif
+
+!ifdef MUI_DIRECTORYPAGE
+  ${LangFileString} MUI_TEXT_DIRECTORY_TITLE "إختر موقع التنصيب"
+  ${LangFileString} MUI_TEXT_DIRECTORY_SUBTITLE "إختر المجلد المراد تنصيب $(^NameDA) فيه."
+!endif
+
+!ifdef MUI_UNDIRECTORYSPAGE
+  ${LangFileString} MUI_UNTEXT_DIRECTORY_TITLE "إختر موقع المزيل"
+  ${LangFileString} MUI_UNTEXT_DIRECTORY_SUBTITLE "إختر المجلد الذي سيزال منه $(^NameDA)."
+!endif
+
+!ifdef MUI_INSTFILESPAGE
+  ${LangFileString} MUI_TEXT_INSTALLING_TITLE "تنصيب"
+  ${LangFileString} MUI_TEXT_INSTALLING_SUBTITLE "الرجاء الإنتظار أثناء تنصيب $(^NameDA)."
+  ${LangFileString} MUI_TEXT_FINISH_TITLE "إنتهى التنصيب"
+  ${LangFileString} MUI_TEXT_FINISH_SUBTITLE "إنتهت عملية التنصيب بنجاح."
+  ${LangFileString} MUI_TEXT_ABORT_TITLE "إلغاء التنصيب"
+  ${LangFileString} MUI_TEXT_ABORT_SUBTITLE "لم ينتهي التنصيب بنجاح."
+!endif
+
+!ifdef MUI_UNINSTFILESPAGE
+  ${LangFileString} MUI_UNTEXT_UNINSTALLING_TITLE "إزالة"
+  ${LangFileString} MUI_UNTEXT_UNINSTALLING_SUBTITLE "الرجاء الإنتظار أثناء إزالة $(^NameDA)."
+  ${LangFileString} MUI_UNTEXT_FINISH_TITLE "إنتهى"
+  ${LangFileString} MUI_UNTEXT_FINISH_SUBTITLE "إنتهت عملية الإزالة بنجاح."
+  ${LangFileString} MUI_UNTEXT_ABORT_TITLE "إلغاء الإزالة"
+  ${LangFileString} MUI_UNTEXT_ABORT_SUBTITLE "لم تنتهي الإزالة بنجاح."
+!endif
+
+!ifdef MUI_FINISHPAGE
+  ${LangFileString} MUI_TEXT_FINISH_INFO_TITLE "إنهاء مرشد إعداد $(^NameDA)"
+  ${LangFileString} MUI_TEXT_FINISH_INFO_TEXT "لقد تم تنصيب $(^NameDA) على الجهاز$\r$\n$\r$\nإضغط إنهاء لإغلاق مرشد الإعداد."
+  ${LangFileString} MUI_TEXT_FINISH_INFO_REBOOT "يجب إعادة تشغيل الجهاز لإنهاء تنصيب $(^NameDA). هل تريد إعادة التشغيل الآن؟"
+!endif
+
+!ifdef MUI_UNFINISHPAGE
+  ${LangFileString} MUI_UNTEXT_FINISH_INFO_TITLE "إنهاء مرشد إزالة $(^NameDA)"
+  ${LangFileString} MUI_UNTEXT_FINISH_INFO_TEXT "لقد تم إزالة $(^NameDA) من الجهاز.$\r$\n$\r$\n إضغط إنهاء لإغلاق المرشد."
+  ${LangFileString} MUI_UNTEXT_FINISH_INFO_REBOOT "يجب إعادة تشغيل الجهاز لإنهاء إزالة $(^NameDA). هل تريد إعادة التشغيل الآن؟"
+!endif
+
+!ifdef MUI_FINISHPAGE | MUI_UNFINISHPAGE
+  ${LangFileString} MUI_TEXT_FINISH_REBOOTNOW "أعد التشغيل الآن"
+  ${LangFileString} MUI_TEXT_FINISH_REBOOTLATER "أرغب في إعادة تشغيل الجهاز في وقت لاحق"
+  ${LangFileString} MUI_TEXT_FINISH_RUN "&شغل $(^NameDA)"
+  ${LangFileString} MUI_TEXT_FINISH_SHOWREADME "اعرض& أقرأني"
+  ${LangFileString} MUI_BUTTONTEXT_FINISH "&إنهاء"  
+!endif
+
+!ifdef MUI_STARTMENUPAGE
+  ${LangFileString} MUI_TEXT_STARTMENU_TITLE "إختر مجلد قائمة ابدأ"
+  ${LangFileString} MUI_TEXT_STARTMENU_SUBTITLE "إختر مجلد قائمة ابدأ لإختصارات $(^NameDA)."
+  ${LangFileString} MUI_INNERTEXT_STARTMENU_TOP "إختر المجلد في قائمة ابدأ الذي ستنشأ فيه إختصارات البرنامج. يمكن أيضا كتابة إسم لإنشاء مجلد جديد."
+  ${LangFileString} MUI_INNERTEXT_STARTMENU_CHECKBOX "لا تنشئ إختصارات"
+!endif
+
+!ifdef MUI_UNCONFIRMPAGE
+  ${LangFileString} MUI_UNTEXT_CONFIRM_TITLE "إزالة $(^NameDA)"
+  ${LangFileString} MUI_UNTEXT_CONFIRM_SUBTITLE "إزالة $(^NameDA) من الجهاز."
+!endif
+
+!ifdef MUI_ABORTWARNING
+  ${LangFileString} MUI_TEXT_ABORTWARNING "هل أنت متأكد من إغلاق منصّب $(^Name)؟"
+!endif
+
+!ifdef MUI_UNABORTWARNING
+  ${LangFileString} MUI_UNTEXT_ABORTWARNING "هل أنت متأكد من أنك الخروج من مزيل $(^Name)؟"
+!endif

Engine/bin/tools/nsis/app/Contrib/Language files/Basque.nlf

@@ -0,0 +1,190 @@
+# Header, don't edit
+NLF v6
+# Language ID
+1069
+# Font and size - dash (-) means default
+-
+-
+# Codepage - dash (-) means ANSI code page
+1252
+# RTL - anything else than RTL means LTR
+-
+# Translation by Iñaki San Vicente
+# ^Branding
+Nullsoft Install System %s
+# ^SetupCaption
+$(^Name) -ren Instalazioa
+# ^UninstallCaption
+$(^Name) -ren Ezabaketa
+# ^LicenseSubCaption
+: Lizentzia hitzarmen agiria
+# ^ComponentsSubCaption
+: Instalazio aukerak
+# ^DirSubCaption
+: Instalazio karpeta
+# ^InstallingSubCaption
+: Instalatzen
+# ^CompletedSubCaption
+: Instalazioa burututa
+# ^UnComponentsSubCaption
+: Ezabaketa aukerak
+# ^UnDirSubCaption
+: Ezabaketa direktorioa
+# ^ConfirmSubCaption
+: Berretsi ezabaketa
+# ^UninstallingSubCaption
+: Ezabatzen
+# ^UnCompletedSubCaption
+: Ezabaketa burututa
+# ^BackBtn
+< &Atzera
+# ^NextBtn
+&Aurrera >
+# ^AgreeBtn
+Onartu
+# ^AcceptBtn
+Lizentzia hitzarmenaren baldintzak onartzen ditut.
+# ^DontAcceptBtn
+Ez ditut lizentzia hitzarmenaren baldintzak onartzen.
+# ^InstallBtn
+&Instalatu
+# ^UninstallBtn
+&Ezabatu
+# ^CancelBtn
+Ezeztatu
+# ^CloseBtn
+&Itxi
+# ^BrowseBtn
+&Arakatu...
+# ^ShowDetailsBtn
+Ikusi &zehaztasunak
+# ^ClickNext
+Sakatu Aurrera jarraitzeko.
+# ^ClickInstall
+Sakatu Instalatu instalazioarekin hasteko.
+# ^ClickUninstall
+Sakatu Ezabatu ezabaketarekin hasteko.
+# ^Name
+Izena
+# ^Completed
+Osatuta
+# ^LicenseText
+Mesedez, aztertu lizentzia hitzarmena $(^NameDA) instalatu aurretik. Baldintza guztiak onartzen badituzu, sakatu Onartu.
+# ^LicenseTextCB
+Mesedez, aztertu lizentzia hitzarmena $(^NameDA) instalatu aurretik. Baldintza guztiak onartzen badituzu, nabarmendu azpiko laukitxoa. $_CLICK
+# ^LicenseTextRB
+Mesedez, aztertu lizentzia hitzarmena $(^NameDA) instalatu aurretik. Baldintza guztiak onartzen badituzu, hautatu azpian lehen aukera. $_CLICK
+# ^UnLicenseText
+Mesedez, aztertu lizentzia hitzarmena $(^NameDA) ezabatu aurretik. Baldintza guztiak onartzen badituzu, sakatu Onartu.
+# ^UnLicenseTextCB
+Mesedez, aztertu lizentzia hitzarmena $(^NameDA) ezabatu aurretik. Baldintza guztiak onartzen badituzu, nabarmendu azpiko laukitxoa. $_CLICK.
+# ^UnLicenseTextRB
+Mesedez, aztertu lizentzia hitzarmena $(^NameDA) ezabatu aurretik. Baldintza guztiak onartzen badituzu, hautatu azpian lehen aukera. $_CLICK
+# ^Custom
+Norberaren nahien arabera
+# ^ComponentsText
+Nabarmendu instalatu nahi diren osagaiak, eta utzi zuri instalatu nahi ez direnak. $_CLICK
+# ^ComponentsSubText1
+Hautatu instalazio mota:
+# ^ComponentsSubText2_NoInstTypes
+Hautatu instalatu beharreko osagaiak:
+# ^ComponentsSubText2
+Edo hautatu instalatu beharreko aukerazko osagaiak:
+# ^UnComponentsText
+Nabarmendu ezabatu nahi diren osagaiak, eta utzi zuri ezabatu nahi ez direnak. $_CLICK
+# ^UnComponentsSubText1
+Hautatu ezabaketa mota:
+# ^UnComponentsSubText2_NoInstTypes
+Hautatu ezabatu beharreko osagaiak:
+# ^UnComponentsSubText2
+Edo hautatu ezabatu beharreko aukerazko osagaiak:
+# ^DirText
+Instalazio programak $(^NameDA) honako karpetan instalatuko du. Beste karpeta batean instalatzeko, sakatu Arakatu eta aukeratu beste bat. $_CLICK
+# ^DirSubText
+Helburu karpeta
+# ^DirBrowseText
+Aukeratu $(^NameDA) instalatuko den karpeta:
+# ^UnDirText
+Instalazio programak $(^NameDA) honako karpetatik ezabatuko du. Beste karpeta batetik ezabatzeko, sakatu Arakatu eta aukeratu beste bat. $_CLICK
+# ^UnDirSubText
+""
+# ^UnDirBrowseText
+Aukeratu $(^NameDA) zein karpetatik ezabatuko den:
+# ^SpaceAvailable
+Leku erabilgarria:
+# ^SpaceRequired
+Behar den lekua:
+# ^UninstallingText
+$(^NameDA) ondorengo karpetan instalatuko da. $_CLICK
+# ^UninstallingSubTex
+Ezabatzen honako karpetatik:
+# ^FileError
+Hutsegitea idazteko fitxategia irekitzean: \r\n\t"$0"\r\nSakatu Irten instalazioa ,\r\nsaiatu berriz fitxategi hau berriz idazten saiatzeko, u\r\njarraitu fitxategi hau alde batera utzita aurrera egiteko
+# ^FileError_NoIgnore
+Hutsegitea idazteko fitxategia irekitzean: \r\n\t"$0"\r\nsaiatu berriz fitxategi hau berriz idazten saiatzeko ,\r\nSakatu Irten instalazioa
+# ^CantWrite
+"Ezin izan da idatzi: "
+# ^CopyFailed
+Kopiatzeak hutsegin du
+# ^CopyTo
+"Kopiatu hona "
+# ^Registering
+"Erregistratzen: "
+# ^Unregistering
+"Erregistroa ezabatzen: "
+# ^SymbolNotFound
+"Ikurra ezin izan da aurkitu: "
+# ^CouldNotLoad
+"Ezin izan da kargatu: "
+# ^CreateFolder
+"Sortu karpeta: "
+# ^CreateShortcut
+"Sortu lasterbidea: "
+# ^CreatedUninstaller
+"Sortu ezabatzailea: "
+# ^Delete
+"Ezabatu fitxategia: "
+# ^DeleteOnReboot
+"Ezabatu berrabiarazitakoan: "
+# ^ErrorCreatingShortcut
+"Hutsegitea lasterbidea sortzerakoan: "
+# ^ErrorCreating
+"Hutsegitea sortzerakoan: "
+# ^ErrorDecompressing
+¡Hutsegitea datuak deskomprimatzean! Instalatzailea okerra?
+# ^ErrorRegistering
+Hutsegitea DLL erregistratzerakoan
+# ^ExecShell
+"Exekutatu agindua: "
+# ^Exec
+"Exekutatu: "
+# ^Extract
+"Kanporatu: "
+# ^ErrorWriting
+"Kanporaketa: hutsegitea fitxategira idazterakoan "
+# ^InvalidOpcode
+Instalatzailea okerra: ekintza kodea ez da baliozkoa
+# ^NoOLE
+"OLE-rik ez honentzako: "
+# ^OutputFolder
+"Irteera karpeta: "
+# ^RemoveFolder
+"Ezabatu karpeta: "
+# ^RenameOnReboot
+"Berrizendatu berrabiarazitakoan: "
+# ^Rename
+"Berrizendatu: "
+# ^Skipped
+"Alde batera utzitakoa: "
+# ^CopyDetails
+Kopiatu xehetasunak arbelera
+# ^LogInstall
+Instalazio prozesuaren erregistroa gorde
+# ^Byte
+B
+# ^Kilo
+K
+# ^Mega
+M
+# ^Giga
+G

Engine/bin/tools/nsis/app/Contrib/Language files/Basque.nsh

@@ -0,0 +1,121 @@
+;Language: Basque (1069)
+;By Iñaki San Vicente
+
+!insertmacro LANGFILE "Basque" "Euskera"
+
+!ifdef MUI_WELCOMEPAGE
+  ${LangFileString} MUI_TEXT_WELCOME_INFO_TITLE "Ongi etorri $(^NameDA) -ren instalazio programara"
+  ${LangFileString} MUI_TEXT_WELCOME_INFO_TEXT "Programa honek $(^NameDA) zure ordenagailuan instalatuko du.$\r$\n$\r$\nAholkatzen da instalazioarekin hasi aurretik beste aplikazio guztiak ixtea. Honek sistemarekin erlazionatuta dauden fitxategien eguneratzea ahalbidetuko du, ordenagailua berrabiarazi beharrik izan gabe.$\r$\n$\r$\n$_CLICK"
+!endif
+
+!ifdef MUI_UNWELCOMEPAGE
+  ${LangFileString} MUI_UNTEXT_WELCOME_INFO_TITLE "Ongi etorri $(^NameDA) -ren ezabaketa programara"
+  ${LangFileString} MUI_UNTEXT_WELCOME_INFO_TEXT "Laguntzaile honek $(^NameDA)-ren ezabaketa prozesuan zehar gidatuko zaitu.$\r$\n$\r$\nEzabaketa hasi aurretik, ziurtatu $(^NameDA) martxan ez dagoela .$\r$\n$\r$\n$_CLICK"
+!endif
+
+!ifdef MUI_LICENSEPAGE
+  ${LangFileString} MUI_TEXT_LICENSE_TITLE "Lizentzia hitzarmena"
+  ${LangFileString} MUI_TEXT_LICENSE_SUBTITLE "Mesedez aztertu lizentziaren baldintzak $(^NameDA) instalatu aurretik."
+  ${LangFileString} MUI_INNERTEXT_LICENSE_BOTTOM "Baldintzak onartzen badituzu, sakatu Onartu aurrera egiteko. Hitzarmena onartzea ezinbestekoa da $(^NameDA) instalatzeko."
+  ${LangFileString} MUI_INNERTEXT_LICENSE_BOTTOM_CHECKBOX "Baldintzak onartzen badituzu, nabarmendu azpiko laukitxoa. Hitzarmena onartzea ezinbestekoa da $(^NameDA) instalatzeko. $_CLICK"
+  ${LangFileString} MUI_INNERTEXT_LICENSE_BOTTOM_RADIOBUTTONS "Baldintzak onartzen badituzu, hautatu azpian lehen aukera. Hitzarmena onartzea ezinbestekoa da $(^NameDA) instalatzeko. $_CLICK"
+!endif
+
+!ifdef MUI_UNLICENSEPAGE
+  ${LangFileString} MUI_UNTEXT_LICENSE_TITLE "Lizentzia hitzarmena"
+  ${LangFileString} MUI_UNTEXT_LICENSE_SUBTITLE "Mesedez aztertu lizentziaren baldintzak $(^NameDA) ezabatu aurretik."
+  ${LangFileString} MUI_UNINNERTEXT_LICENSE_BOTTOM "Baldintzak onartzen badituzu, sakatu Onartu aurrera egiteko. Hitzarmena onartzea ezinbestekoa da $(^NameDA) ezabatzeko."
+  ${LangFileString} MUI_UNINNERTEXT_LICENSE_BOTTOM_CHECKBOX "Baldintzak onartzen badituzu, nabarmendu azpiko laukitxoa. Hitzarmena onartzea ezinbestekoa da $(^NameDA) ezabatzeko. $_CLICK"
+  ${LangFileString} MUI_UNINNERTEXT_LICENSE_BOTTOM_RADIOBUTTONS "Baldintzak onartzen badituzu, hautatu azpian lehen aukera. Hitzarmena onartzea ezinbestekoa da $(^NameDA) ezabatzeko. $_CLICK"
+!endif
+
+!ifdef MUI_LICENSEPAGE | MUI_UNLICENSEPAGE
+  ${LangFileString} MUI_INNERTEXT_LICENSE_TOP "Sakatu Av Pág hitzarmenaren gainontzeko atalak ikusteko."
+!endif
+
+!ifdef MUI_COMPONENTSPAGE
+  ${LangFileString} MUI_TEXT_COMPONENTS_TITLE "Osagaien hautatzea"
+  ${LangFileString} MUI_TEXT_COMPONENTS_SUBTITLE "Hautatu $(^NameDA)-ren zein ezaugarri instalatu nahi duzun."
+  ${LangFileString} MUI_INNERTEXT_COMPONENTS_DESCRIPTION_TITLE "Azalpena"
+!endif
+
+!ifdef MUI_UNCOMPONENTSPAGE
+  ${LangFileString} MUI_UNTEXT_COMPONENTS_TITLE "Osagaien hautatzea"
+  ${LangFileString} MUI_UNTEXT_COMPONENTS_SUBTITLE "Hautatu $(^NameDA)-ren zein ezaugarri ezabatu nahi duzun."
+!endif
+
+!ifdef MUI_COMPONENTSPAGE | MUI_UNCOMPONENTSPAGE
+  !ifndef NSIS_CONFIG_COMPONENTPAGE_ALTERNATIVE
+    ${LangFileString} MUI_INNERTEXT_COMPONENTS_DESCRIPTION_INFO "Jarri sagua osagai baten gainean dagokion azalpena ikusteko."
+  !else
+    ${LangFileString} MUI_INNERTEXT_COMPONENTS_DESCRIPTION_INFO "Jarri sagua osagai baten gainean dagokion azalpena ikusteko."
+  !endif
+!endif
+
+!ifdef MUI_DIRECTORYPAGE
+  ${LangFileString} MUI_TEXT_DIRECTORY_TITLE "Hautatu instalazioaren lekua"
+  ${LangFileString} MUI_TEXT_DIRECTORY_SUBTITLE "Aukeratu $(^NameDA) instalatzeko karpeta."
+!endif
+
+!ifdef MUI_UNDIRECTORYSPAGE
+  ${LangFileString} MUI_UNTEXT_DIRECTORY_TITLE "Aukeratu ezabatuko den karpeta"
+  ${LangFileString} MUI_UNTEXT_DIRECTORY_SUBTITLE "Aukeratu $(^NameDA) zein karpetatik ezabatuko den."
+!endif
+
+!ifdef MUI_INSTFILESPAGE
+  ${LangFileString} MUI_TEXT_INSTALLING_TITLE "Instalatzen"
+  ${LangFileString} MUI_TEXT_INSTALLING_SUBTITLE "Mesedez itxoin $(^NameDA) instalatzen den bitartean."
+  ${LangFileString} MUI_TEXT_FINISH_TITLE "Instalazioa burututa"
+  ${LangFileString} MUI_TEXT_FINISH_SUBTITLE "Instalazioa zuzen burutu da."
+  ${LangFileString} MUI_TEXT_ABORT_TITLE "Instalazioa ezeztatua"
+  ${LangFileString} MUI_TEXT_ABORT_SUBTITLE "Instalazioa ez da zuzen burutu."
+!endif
+
+!ifdef MUI_UNINSTFILESPAGE
+  ${LangFileString} MUI_UNTEXT_UNINSTALLING_TITLE "Ezabatzen"
+  ${LangFileString} MUI_UNTEXT_UNINSTALLING_SUBTITLE "Mesedez itxoin $(^NameDA) ezabatzen den bitartean."
+  ${LangFileString} MUI_UNTEXT_FINISH_TITLE "Ezabatzea burututa"
+  ${LangFileString} MUI_UNTEXT_FINISH_SUBTITLE "Ezabatzea zuzen burutu da."
+  ${LangFileString} MUI_UNTEXT_ABORT_TITLE "Ezabatzea ezeztatuta"
+  ${LangFileString} MUI_UNTEXT_ABORT_SUBTITLE "Ezabatzea ez da zuzen burutu."
+!endif
+
+!ifdef MUI_FINISHPAGE
+  ${LangFileString} MUI_TEXT_FINISH_INFO_TITLE "$(^NameDA)-ren instalazio laguntzailea osatzen"
+  ${LangFileString} MUI_TEXT_FINISH_INFO_TEXT "$(^NameDA) zure sisteman instalatu da.$\r$\n$\r$\nSakatu Amaitu laguntzaile hau ixteko."
+  ${LangFileString} MUI_TEXT_FINISH_INFO_REBOOT "Zure sistema berrabiarazi behar duzu $(^NameDA)-ren instalazioa osatzeko. Orain Berrabiarazi nahi duzu?"
+!endif
+
+!ifdef MUI_UNFINISHPAGE
+  ${LangFileString} MUI_UNTEXT_FINISH_INFO_TITLE "$(^NameDA)-ren ezabaketa laguntzailea osatzen"
+  ${LangFileString} MUI_UNTEXT_FINISH_INFO_TEXT "$(^NameDA) zure sistematik ezabatu da.$\r$\n$\r$\nSakatu Amaitu laguntzaile hau ixteko."
+  ${LangFileString} MUI_UNTEXT_FINISH_INFO_REBOOT "Zure ordenagailuak berrabiarazia izan behar du $(^NameDA)-ren ezabaketa osatzeko. Orain Berrabiarazi nahi duzu?"
+!endif
+
+!ifdef MUI_FINISHPAGE | MUI_UNFINISHPAGE
+  ${LangFileString} MUI_TEXT_FINISH_REBOOTNOW "Berrabiarazi orain"
+  ${LangFileString} MUI_TEXT_FINISH_REBOOTLATER "Neuk berrabiarazi geroago"
+  ${LangFileString} MUI_TEXT_FINISH_RUN "&Exekutatu $(^NameDA)"
+  ${LangFileString} MUI_TEXT_FINISH_SHOWREADME "&Ikusi Readme.txt"
+  ${LangFileString} MUI_BUTTONTEXT_FINISH "&Amaitu"  
+!endif
+
+!ifdef MUI_STARTMENUPAGE
+  ${LangFileString} MUI_TEXT_STARTMENU_TITLE "Aukeratu Hasiera Menuko karpeta"
+  ${LangFileString} MUI_TEXT_STARTMENU_SUBTITLE "Aukeratu Hasiera Menuko karpeta bat $(^NameDA)-ren lasterbideentzako."
+  ${LangFileString} MUI_INNERTEXT_STARTMENU_TOP "Aukeratu Hasiera Menuko karpeta bat, non programaren lasterbideak instalatu nahi dituzun. Karpeta berri bat sortzeko izen bat ere adierazi dezakezu."
+  ${LangFileString} MUI_INNERTEXT_STARTMENU_CHECKBOX "Ez sortu lasterbiderik"
+!endif
+
+!ifdef MUI_UNCONFIRMPAGE
+  ${LangFileString} MUI_UNTEXT_CONFIRM_TITLE "Ezabatu $(^NameDA)"
+  ${LangFileString} MUI_UNTEXT_CONFIRM_SUBTITLE "$(^NameDA) zure sistematik ezabatzen du."
+!endif
+
+!ifdef MUI_ABORTWARNING
+  ${LangFileString} MUI_TEXT_ABORTWARNING "Ziur zaude $(^Name)-ren instalaziotik irten nahi duzula?"
+!endif
+
+!ifdef MUI_UNABORTWARNING
+  ${LangFileString} MUI_UNTEXT_ABORTWARNING "Ziur zaude $(^Name)-ren ezabaketa laguntzailetik irten nahi duzula?"
+!endif

Engine/bin/tools/nsis/app/Contrib/Language files/Belarusian.nlf

@@ -0,0 +1,190 @@
+# Header, don't edit
+NLF v6
+# Language ID
+1059
+# Font and size - dash (-) means default
+-
+-
+# Codepage - dash (-) means ANSI code page
+1251
+# RTL - anything else than RTL means LTR
+-
+# Translation by Sitnikov Vjacheslav [ [email protected] ]
+# ^Branding
+Nullsoft Install System %s
+# ^SetupCaption
+Устаноўка $(^Name)
+# ^UninstallCaption
+Выдаленне $(^Name)
+# ^LicenseSubCaption
+: Ліцэнзійнае пагадненне
+# ^ComponentsSubCaption
+: Параметры ўстаноўкі
+# ^DirSubCaption
+: Папка устаноўкі
+# ^InstallingSubCaption
+: Капіраванне файлаў
+# ^CompletedSubCaption
+: Працэдура завершена
+# ^UnComponentsSubCaption
+: Параметры выдалення
+# ^UnDirSubCaption
+: Папка выдалення
+# ^ConfirmSubCaption
+: Пацвярджэнне
+# ^UninstallingSubCaption
+: Выдаленне файлаў
+# ^UnCompletedSubCaption
+: Працэдура завершана
+# ^BackBtn
+< &Назад
+# ^NextBtn
+&Далей >
+# ^AgreeBtn
+&Згодзен
+# ^AcceptBtn
+Я &прымаю ўмовы Ліцэнзійнага пагаднення
+# ^DontAcceptBtn
+Я н&е прымаю ўмовы Ліцэнзійнага пагаднення
+# ^InstallBtn
+&Усталяваць
+# ^UninstallBtn
+Выд&аліць
+# ^CancelBtn
+Адмяніць
+# ^CloseBtn
+За&чыніць
+# ^BrowseBtn
+А&гляд ...
+# ^ShowDetailsBtn
+Падра&бязна...
+# ^ClickNext
+Націсніце кнопку "Далей", каб працягнуць устаноўку праграмы.
+# ^ClickInstall
+Націсніце кнопку "Усталяваць" для пачатку працэса ўстаноўкі праграмы.
+# ^ClickUninstall
+Націсніце кнопку "Выдаліць" для пачатку працэса выдалення праграмы.
+# ^Name
+Імя
+# ^Completed
+Завершана
+# ^LicenseText
+Калі ласка, прачытайце ўмовы Ліцэнзійнага пагаднення перад пачаткам устаноўкі $(^NameDA). Калі Вы прымаеце ўмовы Ліцэнзійнага пагаднення, націсніце кнопку "Згодзен".
+# ^LicenseTextCB
+Калі ласка, прачытайце ўмовы Ліцэнзійнага пагаднення перад пачаткам устаноўкі $(^NameDA). Калі Вы прымаеце ўмовы Ліцэнзійнага пагаднення, усталюйце сцяжок ніжэй. $_CLICK
+# ^LicenseTextRB
+Калі ласка, прачытайце ўмовы Ліцэнзійнага пагаднення перад пачаткам устаноўкі $(^NameDA). Калі Вы прымаеце ўмовы Ліцэнзійнага пагаднення, вылучыце першы варыянт з прапанаваных нiжэй. $_CLICK
+# ^UnLicenseText
+Калі ласка, прачытайце ўмовы Ліцэнзійнага пагаднення перад пачаткам выдалення $(^NameDA). Калі Вы прымаеце ўмовы Ліцэнзійнага пагаднення, нацiснiце кнопку "Згодзен".
+# ^UnLicenseTextCB
+Калі ласка, прачытайце ўмовы Ліцэнзійнага пагаднення перад пачаткам выдалення $(^NameDA). Калі Вы прымаеце ўмовы Ліцэнзійнага пагаднення, усталюйце сцяжок ніжэй. $_CLICK
+# ^UnLicenseTextRB
+Калі ласка, прачытайце ўмовы Ліцэнзійнага пагаднення перад пачаткам выдалення $(^NameDA). Калі Вы прымаеце ўмовы Ліцэнзійнага пагаднення, вылучыце першы варыянт з прапанаваных нiжэй. $_CLICK
+# ^Custom
+Выбаркова
+# ^ComponentsText
+Вызначце кампаненты праграмы, якiя Вы жадаеце ўстанавiць. $_CLICK
+# ^ComponentsSubText1
+Вызначце тып устаноўкi:
+# ^ComponentsSubText2_NoInstTypes
+Вызначце кампаненты праграмы, каб устанавiць iх:
+# ^ComponentsSubText2
+альбо вызначце кампаненты праграмы, каб устанавiць iх па свайму жаданню:
+# ^UnComponentsText
+Вызначце кампаненты, якiя Вы жадаеце выдалiць, i знiмiце сцяжкі, выбраныя для тых кампанентаў, якiя не трэба выдаляць. $_CLICK
+# ^UnComponentsSubText1
+Вызначце тып выдалення:
+# ^UnComponentsSubText2_NoInstTypes
+Вызначце кампаненты для выдалення:
+# ^UnComponentsSubText2
+альбо вызначце кампаненты праграмы для выдалення:
+# ^DirText
+Праграма ўсталюе $(^NameDA) у вызначаную папку. Каб устанавiць праграму ў iншай папкі, нацiснiце кнопку "Агляд" i вызначце патрэбную папку. $_CLICK
+# ^DirSubText
+Папка устаноўкi
+# ^DirBrowseText
+Вызначце папку для ўстаноўкi $(^NameDA):
+# ^UnDirText
+Праграма выдалiць $(^NameDA) з адзначанай папкі. Каб вырабіць выдаленне з iншай папкі, нацiснiце кнопку "Агляд" i вызначце патрэбную папку. $_CLICK
+# ^UnDirSubText
+""
+# ^UnDirBrowseText
+Вызначце папку, з якой Вы жадаеце выдалiць $(^NameDA):
+# ^SpaceAvailable
+"Дасяжна на дыску: "
+# ^SpaceRequired
+"Патрэбнае месца на дыску: "
+# ^UninstallingText
+Праграма выдалiць $(^NameDA) з Вашага кампутара. $_CLICK
+# ^UninstallingSubText
+Выдаленне з:
+# ^FileError
+Немагчыма адчыніць файл для запiсу: \r\n\r\n$0\r\n\r\nНацiснiце кнопку "Перапынiць", каб перапынiць устаноўку;\r\n"Паўтарыць", каб паўтарыць спробу запiсу ў файл;\r\n"Ігнараваць", каб прапусцiць гэта дзеянне.
+# ^FileError_NoIgnore
+Немагчыма адчыніць файл для запiсу: \r\n\r\n$0\r\n\r\nНацiснiце кнопку "Паўтарыць", каб паўтарыць спробу запiсу ў файл;\r\n"Адмяніць", каб перапынiць устаноўку.
+# ^CantWrite
+"Немагчыма запiсаць: "
+# ^CopyFailed
+Капiраванне няўдала
+# ^CopyTo
+"Капiраванне ў "
+# ^Registering
+"Рэгiстрацыя: "
+# ^Unregistering
+"Выдаленне рэгiстрацыi: "
+# ^SymbolNotFound
+"Немагчыма адшукаць сiмвал: "
+# ^CouldNotLoad
+"Немагчыма загрузiць: "
+# ^CreateFolder
+"Стварэнне папкі: "
+# ^CreateShortcut
+"Стварэнне ярлыку: "
+# ^CreatedUninstaller
+"Стварэнне праграмы выдалення: "
+# ^Delete
+"Выдаленне файла: "
+# ^DeleteOnReboot
+"Выдаленне пасля перезагрузкi кампутара: "
+# ^ErrorCreatingShortcut
+"Памылка стварэння ярлыку: " 
+# ^ErrorCreating
+"Памылка стварэння: "
+# ^ErrorDecompressing
+Немагчыма выцягнуць дадзеныя. Магчыма пашкоджаны дыстрыбутыў.
+# ^ErrorRegistering
+Немагчыма зарэгістраваць бібліятэку (DLL)
+# ^ExecShell
+"Выкананне каманды абалонкі: " 
+# ^Exec
+"Выкананне: "
+# ^Extract
+"Выманне: "
+# ^ErrorWriting
+"Выманне: памылка запiсу файла"
+# ^InvalidOpcode
+дыстрыбутыў пашкоджаны: код памылкi
+# ^NoOLE
+"Няма OLE для: " 
+# ^OutputFolder
+"Каталог устаноўкi: "
+# ^RemoveFolder
+"Выдаленне папкі: "
+# ^RenameOnReboot
+"Пераназва пасля перезагрузкi кампутара: "
+# ^Rename
+"Пераназва: "
+# ^Skipped
+"Прапушчана: "
+# ^CopyDetails
+Капiраваць звесткi ў буфер абмена 
+# ^LogInstall
+Запiсваць у лог працэс устаноўкi
+# byte
+Б
+# kilo
+К
+# mega
+М
+# giga
+Г

Engine/bin/tools/nsis/app/Contrib/Language files/Belarusian.nsh

@@ -0,0 +1,121 @@
+;Language: Belarusian (1059)
+;Translated by Sitnikov Vjacheslav [ [email protected] ]
+
+!insertmacro LANGFILE "Belarusian" "Byelorussian"
+
+!ifdef MUI_WELCOMEPAGE
+  ${LangFileString} MUI_TEXT_WELCOME_INFO_TITLE "Âàñ âiòàå ìàéñòàð ¢ñòàíî¢ê³ $(^NameDA)"
+  ${LangFileString} MUI_TEXT_WELCOME_INFO_TEXT "Ãýòàÿ ïðàãðàìà ¢ñòàëþå $(^NameDA) íà Âàø êàìïóòàð.$\r$\n$\r$\nÏåðàä ïà÷àòêàì óñòàíî¢êi ïðàïàíóåì çà÷ûí³öü óñå ïðàãðàìû, ÿê³ÿ âûêîíâàþööà ¢ ñàïðà¢äíû ìîìàíò. Ãýòà äàïàìîæà ïðàãðàìå ¢ñòàíî¢ê³ àáíàâ³öü ñ³ñòýìíûÿ ôàéëû áåç ïåðàçàãðóçê³ êàìïóòàðà.$\r$\n$\r$\n$_CLICK"
+!endif
+
+!ifdef MUI_UNWELCOMEPAGE
+  ${LangFileString} MUI_UNTEXT_WELCOME_INFO_TITLE "Âàñ âiòàå ìàéñòàð âûäàëåííÿ $(^NameDA)"
+  ${LangFileString} MUI_UNTEXT_WELCOME_INFO_TEXT "Ãýòàÿ ïðàãðàìà âûäàë³öü $(^NameDA) ç Âàøàãà êàìïóòàðà.$\r$\n$\r$\nÏåðàä ïà÷àòêàì âûäàëåííÿ ïåðàêàíàéöåñÿ ¢ òûì, øòî ïðàãðàìà $(^NameDA) íå âûêîíâàåööà.$\r$\n$\r$\n$_CLICK"
+!endif
+
+!ifdef MUI_LICENSEPAGE
+  ${LangFileString} MUI_TEXT_LICENSE_TITLE "Ëiöåíçiéíàå ïàãàäíåííå"
+  ${LangFileString} MUI_TEXT_LICENSE_SUBTITLE "Êàë³ ëàñêà, ïðà÷ûòàéöå ¢ìîâû ˳öýíç³éíàãà ïàãàäíåííÿ ïåðàä ïà÷àòêàì óñòàíî¢êi $(^NameDA)."
+  ${LangFileString} MUI_INNERTEXT_LICENSE_BOTTOM "Êàëi Âû ïðûìàåöå ¢ìîâû Ëiöåíçiéíàãà ïàãàäíåííÿ, íàö³ñí³öå êíîïêó $\"Çãîäçåí$\". Ãýòà íåàáõîäíà äëÿ ¢ñòàíî¢ê³ ïðàãðàìû."
+  ${LangFileString} MUI_INNERTEXT_LICENSE_BOTTOM_CHECKBOX "Êàëi Âû ïðûìàåöå ¢ìîâû Ëiöåíçiéíàãà ïàãàäíåííÿ, óñòàëþéöå ñöÿæîê í³æýé. Ãýòà íåàáõîäíà äëÿ ¢ñòàíî¢ê³ ïðàãðàìû. $_CLICK"
+  ${LangFileString} MUI_INNERTEXT_LICENSE_BOTTOM_RADIOBUTTONS "Êàëi Âû ïðûìàåöå ¢ìîâû ˳öýíç³éíàãà ïàãàäíåííÿ, âûëó÷ûöå ïåðøû âàðûÿíò ç ïðàïàíîâàíûõ í³æýé. Ãýòà íåàáõîäíà äëÿ ¢ñòàíî¢ê³ ïðàãðàìû. $_CLICK"
+!endif
+
+!ifdef MUI_UNLICENSEPAGE
+  ${LangFileString} MUI_UNTEXT_LICENSE_TITLE "˳öýíç³éíàå ïàãàäíåííå"
+  ${LangFileString} MUI_UNTEXT_LICENSE_SUBTITLE "Êàë³ ëàñêà, ïðà÷ûòàéöå ¢ìîâû ˳öýíç³éíàãà ïàãàäíåííÿ ïåðàä ïà÷àòêàì âûäàëåííÿ $(^NameDA)."
+  ${LangFileString} MUI_UNINNERTEXT_LICENSE_BOTTOM "Êàë³ Âû ïðûìàåöå ¢ìîâû ˳öýíç³éíàãà ïàãàäíåííÿ, íàö³ñí³öå êíîïêó $\"Çãîäçåí$\". Ãýòà íåàáõîäíà äëÿ âûäàëåííÿ ïðàãðàìû. $_CLICK"
+  ${LangFileString} MUI_UNINNERTEXT_LICENSE_BOTTOM_CHECKBOX "Êàë³ Âû ïðûìàåöå ¢ìîâû ˳öýíç³éíàãà ïàãàäíåííÿ, óñòàëþéöå ñöÿæîê í³æýé. Ãýòà íåàáõîäíà äëÿ âûäàëåííÿ ïðàãðàìû. $_CLICK"
+  ${LangFileString} MUI_UNINNERTEXT_LICENSE_BOTTOM_RADIOBUTTONS "Êàë³ Âû ïðûìàåöå ¢ìîâû ˳öýíç³éíàãà ïàãàäíåííÿ, âûëó÷ûöå ïåðøû âàðûÿíò ç ïðàïàíàâàíûõ í³æýé. Ãýòà íåàáõîäíà äëÿ âûäàëåííÿ ïðàãðàìû. $_CLICK"
+!endif
+
+!ifdef MUI_LICENSEPAGE | MUI_UNLICENSEPAGE
+  ${LangFileString} MUI_INNERTEXT_LICENSE_TOP "Âûêàðûñòî¢âàéöå êíîïêi $\"PageUp$\" i $\"PageDown$\" äëÿ ïåðàìÿø÷ýííÿ ïà òýêñöå."
+!endif
+
+!ifdef MUI_COMPONENTSPAGE
+  ${LangFileString} MUI_TEXT_COMPONENTS_TITLE "Êàìïàíåíòû ïðàãðàìû, ÿêàÿ ¢ñòà븢âàåööà"
+  ${LangFileString} MUI_TEXT_COMPONENTS_SUBTITLE "Âûçíà÷öå êàìïàíåíòû $(^NameDA), ÿê³ÿ Âû æàäàåöå ¢ñòàëÿâàöü."
+  ${LangFileString} MUI_INNERTEXT_COMPONENTS_DESCRIPTION_TITLE "Àï³ñàííå"
+!endif
+
+!ifdef MUI_UNCOMPONENTSPAGE
+  ${LangFileString} MUI_UNTEXT_COMPONENTS_TITLE "Êàìïàíåíòû ïðàãðàìû"
+  ${LangFileString} MUI_UNTEXT_COMPONENTS_SUBTITLE "Âûçíà÷öå êàìïàíåíòû $(^NameDA), ÿê³ÿ Âû æàäàåöå âûäàë³öü."
+!endif
+
+!ifdef MUI_COMPONENTSPAGE | MUI_UNCOMPONENTSPAGE
+  !ifndef NSIS_CONFIG_COMPONENTPAGE_ALTERNATIVE
+    ${LangFileString} MUI_INNERTEXT_COMPONENTS_DESCRIPTION_INFO "Óñòàëþéöå êóðñîð ìûøû íà íàçâó êàìïàíåíòà, êàá ïðà÷ûòàöü ÿãî àï³ñàííå."
+  !else
+    ${LangFileString} MUI_INNERTEXT_COMPONENTS_DESCRIPTION_INFO "Óñòàëþéöå êóðñîð ìûøû íà íàçâó êàìïàíåíòà, êàá ïðà÷ûòàöü ÿãî àï³ñàííå."
+  !endif
+!endif
+
+!ifdef MUI_DIRECTORYPAGE
+  ${LangFileString} MUI_TEXT_DIRECTORY_TITLE "Âûáàð ïàïê³ ¢ñòàíî¢ê³"
+  ${LangFileString} MUI_TEXT_DIRECTORY_SUBTITLE "Âûçíà÷öå ïàïêó äëÿ ¢ñòàíî¢ê³ $(^NameDA)."
+!endif
+
+!ifdef MUI_UNDIRECTORYSPAGE
+  ${LangFileString} MUI_UNTEXT_DIRECTORY_TITLE "Âûáàð ïàïê³ äëÿ âûäàëåííÿ"
+  ${LangFileString} MUI_UNTEXT_DIRECTORY_SUBTITLE "Âûçíà÷öå ïàïêó, ç ÿêîé ïàòðýáíà âûäàë³öü $(^NameDA)."
+!endif
+
+!ifdef MUI_INSTFILESPAGE
+  ${LangFileString} MUI_TEXT_INSTALLING_TITLE "Êàï³ðàâàííå ôàéëà¢"
+  ${LangFileString} MUI_TEXT_INSTALLING_SUBTITLE "Ïà÷àêàéöå, êàë³ ëàñêà, âûêîíâàåööà êàï³ðàâàííå ôàéëࢠ$(^NameDA) íà Âàø êàìïóòàð..."
+  ${LangFileString} MUI_TEXT_FINISH_TITLE "Óñòàíî¢êà çàâåðøàíà"
+  ${LangFileString} MUI_TEXT_FINISH_SUBTITLE "Óñòàíî¢êà ïàñïÿõîâà çàâåðøàíà."
+  ${LangFileString} MUI_TEXT_ABORT_TITLE "Óñòàíî¢êà ïåðàðâàíà"
+  ${LangFileString} MUI_TEXT_ABORT_SUBTITLE "Óñòàíî¢êà íå çàâåðøàíà."
+!endif
+
+!ifdef MUI_UNINSTFILESPAGE
+  ${LangFileString} MUI_UNTEXT_UNINSTALLING_TITLE "Âûäàëåííå"
+  ${LangFileString} MUI_UNTEXT_UNINSTALLING_SUBTITLE "Ïà÷àêàéöå, êàë³ ëàñêà, âûêîíâàåööà âûäàëåííå ôàéëࢠ$(^NameDA) ç Âàøàãà êàìïóòàðà..."
+  ${LangFileString} MUI_UNTEXT_FINISH_TITLE "Âûäàëåííå çàâåðøàíà"
+  ${LangFileString} MUI_UNTEXT_FINISH_SUBTITLE "Âûäàëåííå ïðàãðàìû ïàñïÿõîâà çàâåðøàíà."
+  ${LangFileString} MUI_UNTEXT_ABORT_TITLE "Âûäàëåííå ïåðàðâàíà"
+  ${LangFileString} MUI_UNTEXT_ABORT_SUBTITLE "Âûäàëåííå âûêàíàíà íå ïî¢íàñöþ."
+!endif
+
+!ifdef MUI_FINISHPAGE
+  ${LangFileString} MUI_TEXT_FINISH_INFO_TITLE "Çàêàí÷ýííå ìàéñòðà ¢ñòàíî¢ê³ $(^NameDA)"
+  ${LangFileString} MUI_TEXT_FINISH_INFO_TEXT "Óñòàíî¢êà $(^NameDA) âûêàíàíà.$\r$\n$\r$\nÍàö³ñí³öå êíîïêó $\"Ãàòîâà$\" äëÿ âûéñöÿ ç ïðàãðàìû ¢ñòàíî¢ê³."
+  ${LangFileString} MUI_TEXT_FINISH_INFO_REBOOT "Êàá çàêîí÷ûöü óñòàíî¢êó $(^NameDA), íåàáõîäíà ïåðàçàãðóç³öü êàìïóòàð. Ö³ æàäàåöå Âû çðàá³öü ãýòà çàðàç?"
+!endif
+
+!ifdef MUI_UNFINISHPAGE
+  ${LangFileString} MUI_UNTEXT_FINISH_INFO_TITLE "Çàêàí÷ýííå ðàáîòû ìàéñòàðà âûäàëåííÿ $(^NameDA)"
+  ${LangFileString} MUI_UNTEXT_FINISH_INFO_TEXT "Ïðàãðàìà $(^NameDA) âûäàëåíà ç Âàøàãà êàìïóòàðà.$\r$\n$\r$\nÍàö³ñí³öå êíîïêó $\"Ãàòîâà$\"êàá âûéñö³ ç ïðàãðàìû âûäàëåííÿ."
+  ${LangFileString} MUI_UNTEXT_FINISH_INFO_REBOOT "Êàá ñêîí÷ûöü âûäàëåííå  $(^NameDA), íåàáõîäíà ïåðàçàãðóç³öü êàìïóòàð. Ö³ æàäàåöå Âû çðàá³öü ãýòà çàðàç?"
+!endif
+
+!ifdef MUI_FINISHPAGE | MUI_UNFINISHPAGE
+  ${LangFileString} MUI_TEXT_FINISH_REBOOTNOW "Òàê, ïåðàçàãðóç³öü êàìïóòàð çàðàç"
+  ${LangFileString} MUI_TEXT_FINISH_REBOOTLATER "Íå, ïåðàçàãðóç³öü êàìïóòàð ïàçíåé"
+  ${LangFileString} MUI_TEXT_FINISH_RUN "&Çàïóñö³öü $(^NameDA)"
+  ${LangFileString} MUI_TEXT_FINISH_SHOWREADME "&Ïàêàçàöü ³íôàðìàöûþ àá ïðàãðàìå"
+  ${LangFileString} MUI_BUTTONTEXT_FINISH "&Ãàòîâà"  
+!endif
+
+!ifdef MUI_STARTMENUPAGE
+  ${LangFileString} MUI_TEXT_STARTMENU_TITLE "Ïàïêà ¢ ìåíþ $\"Ïóñê$\""
+  ${LangFileString} MUI_TEXT_STARTMENU_SUBTITLE "Âûëó÷ûöå ïàïêó ¢ ìåíþ $\"Ïóñê$\" äëÿ ðàçìÿø÷ýííÿ ÿðëûêî¢ ïðàãðàìû."
+  ${LangFileString} MUI_INNERTEXT_STARTMENU_TOP "Âûëó÷ûöå ïàïêó ¢ ìåíþ $\"Ïóñê$\", êóäû áóäóöü çìåø÷àíû ÿðëûê³ ïðàãðàìû. Âû òàêñàìà ìîæàöå àçíà÷ûöü ³íøàå ³ìÿ ïàïê³."
+  ${LangFileString} MUI_INNERTEXT_STARTMENU_CHECKBOX "Íå ñòâàðàöü ÿðëûê³"
+!endif
+
+!ifdef MUI_UNCONFIRMPAGE
+  ${LangFileString} MUI_UNTEXT_CONFIRM_TITLE "Âûäàëåííå $(^NameDA)"
+  ${LangFileString} MUI_UNTEXT_CONFIRM_SUBTITLE "Âûäàëåííå $(^NameDA) ç Âàøàãà êàìïóòàðà."
+!endif
+
+!ifdef MUI_ABORTWARNING
+  ${LangFileString} MUI_TEXT_ABORTWARNING "Âû ñàïðà¢äû æàäàåöå ñêàñàâàöü óñòàíî¢êó $(^Name)?"
+!endif
+
+!ifdef MUI_UNABORTWARNING
+  ${LangFileString} MUI_UNTEXT_ABORTWARNING "Âû ñàïðà¢äû æàäàåöå ñêàñàâàöü âûäàëåííå $(^Name)?"
+!endif