| Index Entry | Section |
|---|
|
| $ | | |
|---|
| $$ | 3.5.3 Actions |
| $n | 3.5.3 Actions |
|
| % | | |
|---|
| %expect | 3.6.5 Suppressing Conflict Warnings |
| %left | 5.3.2 Specifying Operator Precedence |
| %nonassoc | 5.3.2 Specifying Operator Precedence |
| %prec | 5.4 Context-Dependent Precedence |
| %pure_parser | 3.6.7 A Pure (Reentrant) Parser |
| %right | 5.3.2 Specifying Operator Precedence |
| %start | 3.6.6 The Start-Symbol |
| %token | 3.6.1 Token Type Names |
| %type | 3.6.4 Nonterminal Symbols |
| %union | 3.6.3 The Collection of Value Types |
|
| @ | | |
|---|
| @n | 4.4 Special Features for Use in Actions |
|
| | | | |
|---|
| | | 3.3 Syntax of Grammar Rules |
|
| A | | |
|---|
| action | 3.5.3 Actions |
| action data types | 3.5.4 Data Types of Values in Actions |
| action features summary | 4.4 Special Features for Use in Actions |
| actions in mid-rule | 3.5.5 Actions in Mid-Rule |
| actions, semantic | 1.4 Semantic Actions |
| additional C code section | 3.1.4 The Additional C Code Section |
| algorithm of parser | 5. The Bison Parser Algorithm |
| associativity | 5.3.1 When Precedence is Needed |
|
| B | | |
|---|
| Backus-Naur form | 1.1 Languages and Context-Free Grammars |
| Bison declaration summary | 3.6.8 Bison Declaration Summary |
| Bison declarations | 3.6 Bison Declarations |
| Bison declarations (introduction) | 3.1.2 The Bison Declarations Section |
| Bison grammar | 1.2 From Formal Rules to Bison Input |
| Bison invocation | 9. Invoking Bison |
| Bison parser | 1.5 Bison Output: the Parser File |
| Bison parser algorithm | 5. The Bison Parser Algorithm |
| Bison symbols, table of | A. Bison Symbols |
| Bison utility | 1.5 Bison Output: the Parser File |
| BNF | 1.1 Languages and Context-Free Grammars |
|
| C | | |
|---|
| C code, section for additional | 3.1.4 The Additional C Code Section |
| C declarations section | 3.1.1 The C Declarations Section |
| C-language interface | 4. Parser C-Language Interface |
| calc | 2.2 Infix Notation Calculator: calc |
| calculator, infix notation | 2.2 Infix Notation Calculator: calc |
| calculator, multi-function | 2.4 Multi-Function Calculator: mfcalc |
| calculator, simple | 2.1 Reverse Polish Notation Calculator |
| character token | 3.2 Symbols, Terminal and Nonterminal |
| compiling the parser | 2.1.7 Compiling the Parser File |
| conflicts | 5.2 Shift/Reduce Conflicts |
| conflicts, reduce/reduce | 5.6 Reduce/Reduce Conflicts |
| conflicts, suppressing warnings of | 3.6.5 Suppressing Conflict Warnings |
| context-dependent precedence | 5.4 Context-Dependent Precedence |
| context-free grammar | 1.1 Languages and Context-Free Grammars |
| controlling function | 2.1.4 The Controlling Function |
|
| D | | |
|---|
| dangling else | 5.2 Shift/Reduce Conflicts |
| data types in actions | 3.5.4 Data Types of Values in Actions |
| data types of semantic values | 3.5.1 Data Types of Semantic Values |
| debugging | 8. Debugging Your Parser |
| declaration summary | 3.6.8 Bison Declaration Summary |
| declarations, Bison | 3.6 Bison Declarations |
| declarations, Bison (introduction) | 3.1.2 The Bison Declarations Section |
| declarations, C | 3.1.1 The C Declarations Section |
| declaring literal string tokens | 3.6.1 Token Type Names |
| declaring operator precedence | 3.6.2 Operator Precedence |
| declaring the start symbol | 3.6.6 The Start-Symbol |
| declaring token type names | 3.6.1 Token Type Names |
| declaring value types | 3.6.3 The Collection of Value Types |
| declaring value types, nonterminals | 3.6.4 Nonterminal Symbols |
| default action | 3.5.3 Actions |
| default data type | 3.5.1 Data Types of Semantic Values |
| default stack limit | 5.8 Stack Overflow, and How to Avoid It |
| default start symbol | 3.6.6 The Start-Symbol |
| defining language semantics | 3.5 Defining Language Semantics |
|
| E | | |
|---|
| else, dangling | 5.2 Shift/Reduce Conflicts |
| error | 6. Error Recovery |
| error recovery | 6. Error Recovery |
| error recovery, simple | 2.3 Simple Error Recovery |
| error reporting function | 4.3 The Error Reporting Function yyerror |
| error reporting routine | 2.1.5 The Error Reporting Routine |
| examples, simple | 2. Examples |
| exercises | 2.5 Exercises |
|
| F | | |
|---|
| file format | 1.7 The Overall Layout of a Bison Grammar |
| finite-state machine | 5.5 Parser States |
| formal grammar | 1.2 From Formal Rules to Bison Input |
| format of grammar file | 1.7 The Overall Layout of a Bison Grammar |
|
| G | | |
|---|
| glossary | B. Glossary |
| grammar file | 1.7 The Overall Layout of a Bison Grammar |
| grammar rule syntax | 3.3 Syntax of Grammar Rules |
| grammar rules section | 3.1.3 The Grammar Rules Section |
| grammar, Bison | 1.2 From Formal Rules to Bison Input |
| grammar, context-free | 1.1 Languages and Context-Free Grammars |
| grouping, syntactic | 1.1 Languages and Context-Free Grammars |
|
| I | | |
|---|
| infix notation calculator | 2.2 Infix Notation Calculator: calc |
| interface | 4. Parser C-Language Interface |
| introduction | Introduction |
| invoking Bison | 9. Invoking Bison |
| invoking Bison under VMS | 9.3 Invoking Bison under VMS |
|
| L | | |
|---|
| LALR(1) | 5.7 Mysterious Reduce/Reduce Conflicts |
| language semantics, defining | 3.5 Defining Language Semantics |
| layout of Bison grammar | 1.7 The Overall Layout of a Bison Grammar |
| left recursion | 3.4 Recursive Rules |
| lexical analyzer | 4.2 The Lexical Analyzer Function yylex |
| lexical analyzer, purpose | 1.5 Bison Output: the Parser File |
| lexical analyzer, writing | 2.1.3 The rpcalc Lexical Analyzer |
| lexical tie-in | 7.2 Lexical Tie-ins |
| literal string token | 3.2 Symbols, Terminal and Nonterminal |
| literal token | 3.2 Symbols, Terminal and Nonterminal |
| look-ahead token | 5.1 Look-Ahead Tokens |
| LR(1) | 5.7 Mysterious Reduce/Reduce Conflicts |
|