📄 bison_14.htm
字号:
<HTML><HEAD><!-- This HTML file has been created by texi2html 1.44 from /opt/src/gnu/bison-1.25/bison.texinfo on 30 June 1997 --><TITLE>Bison 1.25 - Glossary</TITLE></HEAD><BODY>Go to the <A HREF="bison_1.html">first</A>, <A HREF="bison_13.html">previous</A>, <A HREF="bison_15.html">next</A>, <A HREF="bison_15.html">last</A> section, <A HREF="index.html">table of contents</A>.<HR><H1><A NAME="SEC92" HREF="index.html#SEC92">Glossary</A></H1><P><A NAME="IDX199"></A></P><DL COMPACT><DT>Backus-Naur Form (BNF)<DD>Formal method of specifying context-free grammars. BNF was first usedin the <CITE>ALGOL-60</CITE> report, 1963. See section <A HREF="bison_4.html#SEC8">Languages and Context-Free Grammars</A>.<DT>Context-free grammars<DD>Grammars specified as rules that can be applied regardless of context.Thus, if there is a rule which says that an integer can be used as anexpression, integers are allowed <EM>anywhere</EM> an expression ispermitted. See section <A HREF="bison_4.html#SEC8">Languages and Context-Free Grammars</A>.<DT>Dynamic allocation<DD>Allocation of memory that occurs during execution, rather than atcompile time or on entry to a function.<DT>Empty string<DD>Analogous to the empty set in set theory, the empty string is acharacter string of length zero.<DT>Finite-state stack machine<DD>A "machine" that has discrete states in which it is said to exist ateach instant in time. As input to the machine is processed, themachine moves from state to state as specified by the logic of themachine. In the case of the parser, the input is the language beingparsed, and the states correspond to various stages in the grammarrules. See section <A HREF="bison_8.html#SEC68">The Bison Parser Algorithm</A>.<DT>Grouping<DD>A language construct that is (in general) grammatically divisible;for example, `expression' or `declaration' in C. See section <A HREF="bison_4.html#SEC8">Languages and Context-Free Grammars</A>.<DT>Infix operator<DD>An arithmetic operator that is placed between the operands on which itperforms some operation.<DT>Input stream<DD>A continuous flow of data between devices or programs.<DT>Language construct<DD>One of the typical usage schemas of the language. For example, one ofthe constructs of the C language is the <CODE>if</CODE> statement.See section <A HREF="bison_4.html#SEC8">Languages and Context-Free Grammars</A>.<DT>Left associativity<DD>Operators having left associativity are analyzed from left to right:<SAMP>`a+b+c'</SAMP> first computes <SAMP>`a+b'</SAMP> and then combines with<SAMP>`c'</SAMP>. See section <A HREF="bison_8.html#SEC71">Operator Precedence</A>.<DT>Left recursion<DD>A rule whose result symbol is also its first component symbol;for example, <SAMP>`expseq1 : expseq1 ',' exp;'</SAMP>. See section <A HREF="bison_6.html#SEC42">Recursive Rules</A>.<DT>Left-to-right parsing<DD>Parsing a sentence of a language by analyzing it token by token fromleft to right. See section <A HREF="bison_8.html#SEC68">The Bison Parser Algorithm</A>.<DT>Lexical analyzer (scanner)<DD>A function that reads an input stream and returns tokens one by one.See section <A HREF="bison_7.html#SEC61">The Lexical Analyzer Function <CODE>yylex</CODE></A>.<DT>Lexical tie-in<DD>A flag, set by actions in the grammar rules, which alters the waytokens are parsed. See section <A HREF="bison_10.html#SEC84">Lexical Tie-ins</A>.<DT>Literal string token<DD>A token which constists of two or more fixed characters.See section <A HREF="bison_6.html#SEC40">Symbols, Terminal and Nonterminal</A>.<DT>Look-ahead token<DD>A token already read but not yet shifted. See section <A HREF="bison_8.html#SEC69">Look-Ahead Tokens</A>.<DT>LALR(1)<DD>The class of context-free grammars that Bison (like most other parsergenerators) can handle; a subset of LR(1). See section <A HREF="bison_8.html#SEC79">Mysterious Reduce/Reduce Conflicts</A>.<DT>LR(1)<DD>The class of context-free grammars in which at most one token oflook-ahead is needed to disambiguate the parsing of any piece of input.<DT>Nonterminal symbol<DD>A grammar symbol standing for a grammatical construct that canbe expressed through rules in terms of smaller constructs; in otherwords, a construct that is not a token. See section <A HREF="bison_6.html#SEC40">Symbols, Terminal and Nonterminal</A>.<DT>Parse error<DD>An error encountered during parsing of an input stream due to invalidsyntax. See section <A HREF="bison_9.html#SEC81">Error Recovery</A>.<DT>Parser<DD>A function that recognizes valid sentences of a language by analyzingthe syntax structure of a set of tokens passed to it from a lexicalanalyzer.<DT>Postfix operator<DD>An arithmetic operator that is placed after the operands upon which itperforms some operation.<DT>Reduction<DD>Replacing a string of nonterminals and/or terminals with a singlenonterminal, according to a grammar rule. See section <A HREF="bison_8.html#SEC68">The Bison Parser Algorithm</A>.<DT>Reentrant<DD>A reentrant subprogram is a subprogram which can be in invoked anynumber of times in parallel, without interference between the variousinvocations. See section <A HREF="bison_6.html#SEC56">A Pure (Reentrant) Parser</A>.<DT>Reverse polish notation<DD>A language in which all operators are postfix operators.<DT>Right recursion<DD>A rule whose result symbol is also its last component symbol;for example, <SAMP>`expseq1: exp ',' expseq1;'</SAMP>. See section <A HREF="bison_6.html#SEC42">Recursive Rules</A>.<DT>Semantics<DD>In computer languages, the semantics are specified by the actionstaken for each instance of the language, i.e., the meaning ofeach statement. See section <A HREF="bison_6.html#SEC43">Defining Language Semantics</A>.<DT>Shift<DD>A parser is said to shift when it makes the choice of analyzingfurther input from the stream rather than reducing immediately somealready-recognized rule. See section <A HREF="bison_8.html#SEC68">The Bison Parser Algorithm</A>.<DT>Single-character literal<DD>A single character that is recognized and interpreted as is.See section <A HREF="bison_4.html#SEC9">From Formal Rules to Bison Input</A>.<DT>Start symbol<DD>The nonterminal symbol that stands for a complete valid utterance inthe language being parsed. The start symbol is usually listed as thefirst nonterminal symbol in a language specification. See section <A HREF="bison_6.html#SEC55">The Start-Symbol</A>.<DT>Symbol table<DD>A data structure where symbol names and associated data are storedduring parsing to allow for recognition and use of existinginformation in repeated uses of a symbol. See section <A HREF="bison_5.html#SEC29">Multi-Function Calculator: <CODE>mfcalc</CODE></A>.<DT>Token<DD>A basic, grammatically indivisible unit of a language. The symbolthat describes a token in the grammar is a terminal symbol.The input of the Bison parser is a stream of tokens which comes fromthe lexical analyzer. See section <A HREF="bison_6.html#SEC40">Symbols, Terminal and Nonterminal</A>.<DT>Terminal symbol<DD>A grammar symbol that has no rules in the grammar and thereforeis grammatically indivisible. The piece of text it representsis a token. See section <A HREF="bison_4.html#SEC8">Languages and Context-Free Grammars</A>.</DL><HR>Go to the <A HREF="bison_1.html">first</A>, <A HREF="bison_13.html">previous</A>, <A HREF="bison_15.html">next</A>, <A HREF="bison_15.html">last</A> section, <A HREF="index.html">table of contents</A>.</BODY></HTML>⌨️ 快捷键说明
复制代码
Ctrl + C
搜索代码
Ctrl + F
全屏模式
F11
切换主题
Ctrl + Shift + D
显示快捷键
?
增大字号
Ctrl + =
减小字号
Ctrl + -