www.delorie.com/gnu/docs/bison/bison_39.html

search

	Buy the book!

Bison 1.875

[ < ]

[ > ]

[ << ]

[ Up ]

[ >> ]

[Top]

[Contents]

[Index]

[ ? ]

3. Bison Grammar Files

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 `.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 Syntax of Grammar Rules    How to write grammar rules.

3.4 Recursive Rules    Writing recursive rules.

3.5 Defining Language Semantics    Semantic values and actions.

3.6 Tracking Locations    Locations and 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.

webmaster donations bookstore	delorie software privacy
Copyright © 2003 by The Free Software Foundation	Updated Jun 2003

Please take a moment to fill out this visitor survey
You can help support this site by visiting the advertisers that sponsor it! (only once each, though)

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 Syntax of Grammar Rules		How to write grammar rules.
3.4 Recursive Rules		Writing recursive rules.
3.5 Defining Language Semantics		Semantic values and actions.
3.6 Tracking Locations		Locations and 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.