| [ < ] | [ > ] | [ << ] | [ Up ] | [ >> ] | [Top] | [Contents] | [Index] | [ ? ] |
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 file conventionally has a name ending in ‘.y’. See section Invoking Bison.
| 3.1 Outline of a Bison Grammar | Overall layout of the grammar file. | |
| 3.2 Symbols, Terminal and Nonterminal | Terminal and nonterminal symbols. | |
| 3.3 Grammar Rules | How to write grammar rules. | |
| 3.4 Defining Language Semantics | Semantic values and actions. | |
| 3.5 Tracking Locations | Locations and actions. | |
| 3.6 Named References | Using named references in actions. | |
| 3.7 Bison Declarations | All kinds of Bison declarations are described here. | |
| 3.8 Multiple Parsers in the Same Program | Putting more than one Bison parser in one program. |
| [ < ] | [ > ] | [ << ] | [ Up ] | [ >> ] |
This document was generated by Rick Perry on December 29, 2013 using texi2html 1.82.