| Index Entry | Section |
|---|
|
| M | | |
|---|
| main function in simple example | 2.1.4 The Controlling Function |
| mfcalc | 2.4 Multi-Function Calculator: mfcalc |
| mid-rule actions | 3.5.5 Actions in Mid-Rule |
| multi-character literal | 3.2 Symbols, Terminal and Nonterminal |
| multi-function calculator | 2.4 Multi-Function Calculator: mfcalc |
| mutual recursion | 3.4 Recursive Rules |
|
| N | | |
|---|
| nonterminal symbol | 3.2 Symbols, Terminal and Nonterminal |
|
| O | | |
|---|
| operator precedence | 5.3 Operator Precedence |
| operator precedence, declaring | 3.6.2 Operator Precedence |
| options for invoking Bison | 9. Invoking Bison |
| overflow of parser stack | 5.8 Stack Overflow, and How to Avoid It |
|
| P | | |
|---|
| parse error | 4.3 The Error Reporting Function yyerror |
| parser | 1.5 Bison Output: the Parser File |
| parser stack | 5. The Bison Parser Algorithm |
| parser stack overflow | 5.8 Stack Overflow, and How to Avoid It |
| parser state | 5.5 Parser States |
| polish notation calculator | 2.1 Reverse Polish Notation Calculator |
| precedence declarations | 3.6.2 Operator Precedence |
| precedence of operators | 5.3 Operator Precedence |
| precedence, context-dependent | 5.4 Context-Dependent Precedence |
| precedence, unary operator | 5.4 Context-Dependent Precedence |
| preventing warnings about conflicts | 3.6.5 Suppressing Conflict Warnings |
| pure parser | 3.6.7 A Pure (Reentrant) Parser |
|
| R | | |
|---|
| recovery from errors | 6. Error Recovery |
| recursive rule | 3.4 Recursive Rules |
| reduce/reduce conflict | 5.6 Reduce/Reduce Conflicts |
| reduction | 5. The Bison Parser Algorithm |
| reentrant parser | 3.6.7 A Pure (Reentrant) Parser |
| reverse polish notation | 2.1 Reverse Polish Notation Calculator |
| right recursion | 3.4 Recursive Rules |
| rpcalc | 2.1 Reverse Polish Notation Calculator |
| rule syntax | 3.3 Syntax of Grammar Rules |
| rules section for grammar | 3.1.3 The Grammar Rules Section |
| running Bison (introduction) | 2.1.6 Running Bison to Make the Parser |
|
| S | | |
|---|
| semantic actions | 1.4 Semantic Actions |
| semantic value | 1.3 Semantic Values |
| semantic value type | 3.5.1 Data Types of Semantic Values |
| shift/reduce conflicts | 5.2 Shift/Reduce Conflicts |
| shifting | 5. The Bison Parser Algorithm |
| simple examples | 2. Examples |
| single-character literal | 3.2 Symbols, Terminal and Nonterminal |
| stack overflow | 5.8 Stack Overflow, and How to Avoid It |
| stack, parser | 5. The Bison Parser Algorithm |
| stages in using Bison | 1.6 Stages in Using Bison |
| start symbol | 1.1 Languages and Context-Free Grammars |
| start symbol, declaring | 3.6.6 The Start-Symbol |
| state (of parser) | 5.5 Parser States |
| string token | 3.2 Symbols, Terminal and Nonterminal |
| summary, action features | 4.4 Special Features for Use in Actions |
| summary, Bison declaration | 3.6.8 Bison Declaration Summary |
| suppressing conflict warnings | 3.6.5 Suppressing Conflict Warnings |
| symbol | 3.2 Symbols, Terminal and Nonterminal |
| symbol table example | 2.4.3 The mfcalc Symbol Table |
| symbols (abstract) | 1.1 Languages and Context-Free Grammars |
| symbols in Bison, table of | A. Bison Symbols |
| syntactic grouping | 1.1 Languages and Context-Free Grammars |
| syntax error | 4.3 The Error Reporting Function yyerror |
| syntax of grammar rules | 3.3 Syntax of Grammar Rules |
|
| T | | |
|---|
| terminal symbol | 3.2 Symbols, Terminal and Nonterminal |
| token | 1.1 Languages and Context-Free Grammars |
| token type | 3.2 Symbols, Terminal and Nonterminal |
| token type names, declaring | 3.6.1 Token Type Names |
| tracing the parser | 8. Debugging Your Parser |
|
| U | | |
|---|
| unary operator precedence | 5.4 Context-Dependent Precedence |
| using Bison | 1.6 Stages in Using Bison |
|
| V | | |
|---|
| value type, semantic | 3.5.1 Data Types of Semantic Values |
| value types, declaring | 3.6.3 The Collection of Value Types |
| value types, nonterminals, declaring | 3.6.4 Nonterminal Symbols |
| value, semantic | 1.3 Semantic Values |
| VMS | 9.3 Invoking Bison under VMS |
|
| W | | |
|---|
| warnings, preventing | 3.6.5 Suppressing Conflict Warnings |
| writing a lexical analyzer | 2.1.3 The rpcalc Lexical Analyzer |
|
| Y | | |
|---|
| YYABORT | 4.1 The Parser Function yyparse |
| YYACCEPT | 4.1 The Parser Function yyparse |
| YYBACKUP | 4.4 Special Features for Use in Actions |
| yychar | 5.1 Look-Ahead Tokens |
| yyclearin | 6. Error Recovery |
| YYDEBUG | 8. Debugging Your Parser |
| yydebug | 8. Debugging Your Parser |
| YYEMPTY | 4.4 Special Features for Use in Actions |
| yyerrok | 6. Error Recovery |
| yyerror | 4.3 The Error Reporting Function yyerror |
| YYERROR | 4.4 Special Features for Use in Actions |
| YYERROR_VERBOSE | 4.3 The Error Reporting Function yyerror |
| YYINITDEPTH | 5.8 Stack Overflow, and How to Avoid It |
| yylex | 4.2 The Lexical Analyzer Function yylex |
| YYLEX_PARAM | 4.2.4 Calling Conventions for Pure Parsers |
| yylloc | 4.2.3 Textual Positions of Tokens |
| YYLTYPE | 4.2.3 Textual Positions of Tokens |
| yylval | 4.2.2 Semantic Values of Tokens |
| YYMAXDEPTH | 5.8 Stack Overflow, and How to Avoid It |
| yynerrs | 4.3 The Error Reporting Function yyerror |
| yyparse | 4.1 The Parser Function yyparse |
| YYPARSE_PARAM | 4.2.4 Calling Conventions for Pure Parsers |
| YYPRINT | 8. Debugging Your Parser |
| YYRECOVERING | 6. Error Recovery |
|