Manual

More documents

Recommendations

Info

124 Bison 2.3 Left associativity Operators having left associativity are analyzed from left to right: ‘a+b+c’ first computes ‘a+b’ and then combines with ‘c’. See Section 5.3 [Operator Precedence], page 73. Left recursion A rule whose result symbol is also its first component symbol; for example, ‘expseq1 : expseq1 ’,’ exp;’. See Section 3.4 [Recursive Rules], page 45. Left-to-right parsing Parsing a sentence of a language by analyzing it token by token from left to right. See Chapter 5 [The Bison Parser Algorithm], page 71. Lexical analyzer (scanner) A function that reads an input stream and returns tokens one by one. Section 4.2 [The Lexical Analyzer Function yylex], page 64. Lexical tie-in A flag, set by actions in the grammar rules, which alters the way tokens are parsed. See Section 7.2 [Lexical Tie-ins], page 86. Literal string token A token which consists of two or more fixed characters. See Section 3.2 [Symbols], page 42. Look-ahead token A token already read but not yet shifted. See Section 5.1 [Look-Ahead Tokens], page 71. LALR(1) LR(1) The class of context-free grammars that Bison (like most other parser generators) can handle; a subset of LR(1). See Section 5.7 [Mysterious Reduce/Reduce Conflicts], page 77. The class of context-free grammars in which at most one token of look-ahead is needed to disambiguate the parsing of any piece of input. Nonterminal symbol A grammar symbol standing for a grammatical construct that can be expressed through rules in terms of smaller constructs; in other words, a construct that is not a token. See Section 3.2 [Symbols], page 42. Parser A function that recognizes valid sentences of a language by analyzing the syntax structure of a set of tokens passed to it from a lexical analyzer. Postfix operator An arithmetic operator that is placed after the operands upon which it performs some operation. Reduction Reentrant Replacing a string of nonterminals and/or terminals with a single nonterminal, according to a grammar rule. See Chapter 5 [The Bison Parser Algorithm], page 71. A reentrant subprogram is a subprogram which can be in invoked any number of times in parallel, without interference between the various invocations. See Section 3.7.10 [A Pure (Reentrant) Parser], page 58. See
Appendix B: Glossary 125 Reverse polish notation A language in which all operators are postfix operators. Right recursion A rule whose result symbol is also its last component symbol; for example, ‘expseq1: exp ’,’ expseq1;’. See Section 3.4 [Recursive Rules], page 45. Semantics Shift In computer languages, the semantics are specified by the actions taken for each instance of the language, i.e., the meaning of each statement. See Section 3.5 [Defining Language Semantics], page 46. A parser is said to shift when it makes the choice of analyzing further input from the stream rather than reducing immediately some already-recognized rule. See Chapter 5 [The Bison Parser Algorithm], page 71. Single-character literal A single character that is recognized and interpreted as is. See Section 1.2 [From Formal Rules to Bison Input], page 12. Start symbol The nonterminal symbol that stands for a complete valid utterance in the language being parsed. The start symbol is usually listed as the first nonterminal symbol in a language specification. See Section 3.7.9 [The Start-Symbol], page 58. Symbol table A data structure where symbol names and associated data are stored during parsing to allow for recognition and use of existing information in repeated uses of a symbol. See Section 2.5 [Multi-function Calc], page 34. Syntax error An error encountered during parsing of an input stream due to invalid syntax. See Chapter 6 [Error Recovery], page 83. Token A basic, grammatically indivisible unit of a language. The symbol that describes a token in the grammar is a terminal symbol. The input of the Bison parser is a stream of tokens which comes from the lexical analyzer. See Section 3.2 [Symbols], page 42. Terminal symbol A grammar symbol that has no rules in the grammar and therefore is grammatically indivisible. The piece of text it represents is a token. See Section 1.1 [Languages and Context-Free Grammars], page 11.
Page 1 and 2:
Bison The Yacc-compatible Parser Ge
Page 3 and 4:
i Table of Contents Introduction .
Page 5 and 6:
4 Parser C-Language Interface . . .
Page 7 and 8:
Introduction 1 Introduction Bison i
Page 9 and 10:
Conditions for Using Bison 3 Condit
Page 11 and 12:
GNU GENERAL PUBLIC LICENSE 5 GNU GE
Page 13 and 14:
GNU GENERAL PUBLIC LICENSE 7 Thus,
Page 15 and 16:
GNU GENERAL PUBLIC LICENSE 9 which
Page 17 and 18:
Chapter 1: The Concepts of Bison 11
Page 19 and 20:
Page 21 and 22:
Page 23 and 24:
Page 25 and 26:
Page 27 and 28:
Page 29 and 30:
Chapter 2: Examples 23 2 Examples N
Page 31 and 32:
Chapter 2: Examples 25 ; This defin
Page 33 and 34:
Chapter 2: Examples 27 A token type
Page 35 and 36:
Chapter 2: Examples 29 4 9 + 13 3 7
Page 37 and 38:
Chapter 2: Examples 31 This additio
Page 39 and 40:
Chapter 2: Examples 33 To this end,
Page 41 and 42:
Chapter 2: Examples 35 %{ #include
Page 43 and 44:
Chapter 2: Examples 37 struct init
Page 45 and 46:
Chapter 2: Examples 39 } } /* Initi
Page 47 and 48:
Chapter 3: Bison Grammar Files 41 3
Page 49 and 50:
Chapter 3: Bison Grammar Files 43
Page 51 and 52:
Chapter 3: Bison Grammar Files 45 W
Page 53 and 54:
Chapter 3: Bison Grammar Files 47
Page 55 and 56:
Chapter 3: Bison Grammar Files 49 a
Page 57 and 58:
Chapter 3: Bison Grammar Files 51 I
Page 59 and 60:
Chapter 3: Bison Grammar Files 53 I
Page 61 and 62:
Chapter 3: Bison Grammar Files 55 %
Page 63 and 64:
Chapter 3: Bison Grammar Files 57 3
Page 65 and 66:
Chapter 3: Bison Grammar Files 59 T
Page 67 and 68:
Chapter 3: Bison Grammar Files 61 T
Page 69 and 70:
Chapter 4: Parser C-Language Interf
Page 71 and 72:
Page 73 and 74:
Page 75 and 76:
Page 77 and 78:
Chapter 5: The Bison Parser Algorit
Page 79 and 80: Chapter 5: The Bison Parser Algorit
Page 89 and 90: Chapter 6: Error Recovery 83 6 Erro
Page 91 and 92: Chapter 7: Handling Context Depende
Page 93 and 94: Chapter 7: Handling Context Depende
Page 95 and 96: Chapter 8: Debugging Your Parser 89
Page 103 and 104: Chapter 9: Invoking Bison 97 9 Invo
Page 105 and 106: Chapter 9: Invoking Bison 99 ‘--d
Page 107 and 108: Chapter 10: C++ Language Interface
Page 117 and 118: Chapter 11: Frequently Asked Questi
Page 123 and 124: Appendix A: Bison Symbols 117 Appen
Page 125 and 126: Appendix A: Bison Symbols 119 two s
Page 127 and 128: Appendix A: Bison Symbols 121 or (i
Page 129: Appendix B: Glossary 123 Appendix B
Page 133 and 134: Appendix C: Copying This Manual 127
Page 141 and 142: Index 135 Index $ $$ . . . . . . .
Page 143 and 144: Index 137 LALR(1) grammars . . . .
show all

Manual

Create successful ePaper yourself

Delete template?

Save as template?