Bison

The YACC-compatible Parser Generator

14 October 2002, Bison Version 1.75

• Introduction
• Conditions for Using Bison
• GNU GENERAL PUBLIC LICENSE
  • Preamble
  • TERMS AND CONDITIONS FOR COPYING, DISTRIBUTION AND MODIFICATION
  • Appendix: How to Apply These Terms to Your New Programs
• The Concepts of Bison
  • Languages and Context-Free Grammars
  • From Formal Rules to Bison Input
  • Semantic Values
  • Semantic Actions
  • Writing GLR Parsers
  • Locations
  • Bison Output: the Parser File
  • Stages in Using Bison
  • The Overall Layout of a Bison Grammar
• Examples
  • Reverse Polish Notation Calculator
    • Declarations for rpcalc
    • Grammar Rules for rpcalc
      • Explanation of input
      • Explanation of line
      • Explanation of expr
    • The rpcalc Lexical Analyzer
    • The Controlling Function
    • The Error Reporting Routine
    • Running Bison to Make the Parser
    • Compiling the Parser File
  • Infix Notation Calculator: calc
  • Simple Error Recovery
  • Location Tracking Calculator: ltcalc
    • Declarations for ltcalc
    • Grammar Rules for ltcalc
    • The ltcalc Lexical Analyzer.
  • Multi-Function Calculator: mfcalc
    • Declarations for mfcalc
    • Grammar Rules for mfcalc
    • The mfcalc Symbol Table
  • Exercises
• Bison Grammar Files
  • Outline of a Bison Grammar
    • The prologue
    • The Bison Declarations Section
    • The Grammar Rules Section
    • The epilogue
  • Symbols, Terminal and Nonterminal
  • Syntax of Grammar Rules
  • Recursive Rules
  • Defining Language Semantics
    • Data Types of Semantic Values
    • More Than One Value Type
    • Actions
    • Data Types of Values in Actions
    • Actions in Mid-Rule
  • Tracking Locations
    • Data Type of Locations
    • Actions and Locations
    • Default Action for Locations
  • Bison Declarations
    • Token Type Names
    • Operator Precedence
    • The Collection of Value Types
    • Nonterminal Symbols
    • Suppressing Conflict Warnings
    • The Start-Symbol
    • A Pure (Reentrant) Parser
    • Bison Declaration Summary
  • Multiple Parsers in the Same Program
• Parser C-Language Interface
  • The Parser Function yyparse
  • The Lexical Analyzer Function yylex
    • Calling Convention for yylex
    • Semantic Values of Tokens
    • Textual Positions of Tokens
    • Calling Conventions for Pure Parsers
  • The Error Reporting Function yyerror
  • Special Features for Use in Actions
• The Bison Parser Algorithm
  • Look-Ahead Tokens
  • Shift/Reduce Conflicts
  • Operator Precedence
    • When Precedence is Needed
    • Specifying Operator Precedence
    • Precedence Examples
    • How Precedence Works
  • Context-Dependent Precedence
  • Parser States
  • Reduce/Reduce Conflicts
  • Mysterious Reduce/Reduce Conflicts
  • Generalized LR (GLR) Parsing
  • Stack Overflow, and How to Avoid It
• Error Recovery
• Handling Context Dependencies
  • Semantic Info in Token Types
  • Lexical Tie-ins
  • Lexical Tie-ins and Error Recovery
• Debugging Your Parser
  • Understanding Your Parser
  • Tracing Your Parser
• Invoking Bison
  • Bison Options
  • Option Cross Key
  • Invoking Bison under VMS
• Frequently Asked Questions
  • Parser Stack Overflow
• Bison Symbols
• Glossary
• Copying This Manual
  • GNU Free Documentation License
    • ADDENDUM: How to use this License for your documents
• Index

This document was generated on 9 November 2002 using texi2html 1.56k.