你不必为每一个规则都指定动作. 当一个规则没有动作时,Bison会默认地将1的值复制给以便成为刚刚被规则识别的加法表达式的语义值. 如果`+'记号有一个有用的语义值,可以通过2引用它.

注意到垂直杠字符|'的确是一个分隔符, 并且动作只被附加到一个单一的规则上. 这是一点和Flex工具不同的地方. 在Flex中,|'既代表"或者"也能代表"与下一个规则有着相同的动作". 在下面的例子中,动作仅在`b'被发现的时候触发.

a-or-b: 'a'|'b' { a_or_b_found = 1; };

如果你并没有指明一个规则的动作,Bison提供了默认的动作: 和$n结构总是那种类型.

如果你已经使用了%union指定了多种数据类型, 那么你必须从这些类型中为每一个可以有语义值的终结符或非终结符声明一种. 之后当你每次使用复制来设置它的值, 并且规则之中的后一个动作可应使用n引用这个值. 由于没有符号可以命名这个动作, 所以没有办法为这个值事先声明一个数据类型. 每当你引用这个值的时候你必须使用`<…>n'结构来指明一个数据类型.

没有办法在规则中动作中为整个规则设定一个值, 因为对=6;) 之后,前一个动作的语义值(注5)被用来存储先前的变量列表.(注:pop_context ($5)) 这将临时的let-变量从列表中删除. 这样作的目的是让它不出现在分析程序的其余部分的时候.

由于分析器为了执行动作而进行强制分析, 在一个规则没有完全被识别之前执行动作经常会导致冲突. 例如,如下的两个规则,并没有规则中的动作,可以在分析器中共存. 因为分析器可以移进一个左大括号并且查看之后跟随的符号来确定这是否是一个声明.

compound: '{' declarations statements '}'
| '{' statements '}'
;

但是当我们向下面这样添加一个规则中的动作时,规则就失效了:

compound: { prepare_for_local_variables (); }
'{' declarations statements '}'
| '{' statements '}'
;

现在,当分析器还没有读到左到括号的时候,它就被迫决定是否执行规则中的动作. 换句话说,当分析器没有足够的信息作出正确选择的时候, 它就会强制使用一个或者其它的规则. (这个时候由于分析器仍在决定怎么办, 左大括号记号被称之为超前扫描记号(look-ahead). 参阅 超前扫描记号-Look-Ahead Token.) (注:这个时候两个规则的超前扫描记号都是`{')

你可能认为给这两个规则放置相同的动作可以解决这个问题,就像这样:

compound: { prepare_for_local_variables (); }
'{' declarations statements '}'
| { prepare_for_local_variables (); }
'{' statements '}'
;

但是这种方法不可行,因为Bison并没有意识到两个动作是完全相同的. (Bison永远不会尝试理解动作中的C代码.)

如果语法是这样的:可以依靠第一个记号(C语言就是这样)识别出一个声明. 那么将动作放到左大括号后是一个可行的解决方法. 就像这样:

compound: '{' { prepare_for_local_variables (); }
declarations statements '}'
| '{' statements '}'
;

现在接下来的声明或者语句的第一个记号(注:超前扫描记号) 在任何情况下都会告知Bison该使用哪一个规则.

另外一种解决方法是将动作放入一个做为子规则的非终结符.

subroutine: /* empty */
{ prepare_for_local_variables (); }
;

compound: subroutine
'{' declarations statements '}'
| subroutine
'{' statements '}'
;

现在Bison不用却确定最终使用的规则就可执行规则subroutine中的动作. 注意到:现在动作已经在规则的结尾. 任何规则中间的动作都可以由这种方法转化为一个规则结尾的动作, 并且这也是Bison处理规则中间的动作的方法.

--------------------------------------------------------------------------------
[ < ] [ > ] [ << ] [ 上层 ] [ >> ] [顶层] [内容] [索引] [ ? ]
6 追踪位置-Tracking Locations
虽然语法规则和语义值对于编写功能完善的分析器来说足够用了, 但是处理一些额外的信息特别是符号位置的信息也是非常有用的.

处理位置的方法由一个数据类型和规则被匹配时执行的动作定义的.
6.1 位置的数据类型-Data Type of Locations 描述位置的数据类型.
3.6.2 动作和位置-Actions and Locations 在动作中使用位置.
3.6.3 位置的默认动作-Default Action for Locations 定义了一个计算位置的通用方法.

--------------------------------------------------------------------------------
[ < ] [ > ] [ << ] [ 上层 ] [ >> ] [顶层] [内容] [索引] [ ? ]
6.1 位置的数据类型-Data Type of Locations
由于所有的记号和组总是使用相同的类型, 定义一个位置的数据类型要比定义语义值的简单的多.

位置的类型由一个名为YYLTYPE的宏定义. 当YYLTYPE没有被定义的时候, Bison使用含有四个成员的结构体作为默认的定义:

typedef struct YYLTYPE
{
int first_line; /* 第一行 /
int first_column; / 第一列 /
int last_line; / 最后一行 /
int last_column; / 最后一列 */
} YYLTYPE;

--------------------------------------------------------------------------------
[ < ] [ > ] [ << ] [ 上层 ] [ >> ] [顶层] [内容] [索引] [ ? ]
6.2 动作和位置-Actions and Locations
动作不仅仅是为了定义语言的语义, 它还可以使用位置描述输出的分析器的行为.

最明显的为语法组建立位置的方法与计算语义值的方法相似. 在一个给定的规则中, 多种结构可以用于访问被匹配元素的位置. 右手端第n个部件的位置是@n 而左边的组的位置是@$.

这是一个基本的使用位置的默认数据类型的例子:

exp: …
| exp '/' exp
{
@.first_column = @1.first_column; @.first_line = @1.first_line;
@.last_column = @3.last_column;ip @.last_line = @3.last_line;
if ($3)

= 1 / 3; else {
= 1;
fprintf (stderr,
"Division by zero, l%d,c%d-l%d,c%d",
@3.first_line, @3.first_column,
@3.last_line, @3.last_column);
}
}

就像对语义值一样,有一个每当规则被匹配时的位置的默认动作. 它将@的开始设置为第一个符号的开始并将@的末尾设为最后一个符号的末尾.

可以通过使用这个默认的动作来实现位置追踪的全自动. 上面的例子可以简单地这样重写:

exp: …
| exp '/' exp
{
if ($3)

= 1 / 3; else {
= 1;
fprintf (stderr,
"Division by zero, l%d,c%d-l%d,c%d",
@3.first_line, @3.first_column,
@3.last_line, @3.last_column);
}
}

--------------------------------------------------------------------------------
[ < ] [ > ] [ << ] [ 上层 ] [ >> ] [顶层] [内容] [索引] [ ? ]
6.3 位置的默认动作-Default Action for Locations
实际上,动作并不是计算位置的最好地方. 由于位置比语义值更普遍, 所以在输出的分析器里有用来重定义每个规则的默认动作(注:对位置的)的空间. YYLLOC_DEFAULT宏每当一个规则被匹配而关联的动作尚未执行之前被调用. 当处理一个语法错误要计算错误的位置的时候,它也会被调用.

大多数时候, 这个宏足以胜过语义动作中专注于位置的代码.

YYLOC_DEFAULT宏带有三个参数. 第一个是组(计算结果)的位置. 当匹配一个规则时, 第二个参数标识了正在匹配的规则的所有右端元素的位置, 第三个参数是规则右端元素的大小; 当处理一个语法错误的时候, 第二个参数标识了在错误处理中丢弃的符号的位置, 第三个参数是丢弃符号的数量.

YYLOC_DEFAULT默认地被这样定义:

define YYLLOC_DEFAULT(Current, Rhs, N) /

do /
if (N) /
{ /
(Current).first_line = YYRHSLOC(Rhs, 1).first_line; /
(Current).first_column = YYRHSLOC(Rhs, 1).first_column; /
(Current).last_line = YYRHSLOC(Rhs, N).last_line; /
(Current).last_column = YYRHSLOC(Rhs, N).last_column; /
} /
else /
{ /
(Current).first_line = (Current).last_line = /
YYRHSLOC(Rhs, 0).last_line; /
(Current).first_column = (Current).last_column = /
YYRHSLOC(Rhs, 0).last_column; /
} /
while (0)

当k是正数的时候, 函数YYRHSLOC (rhs,k)返回的是第k个符号的位置. 当k和位置n都为零的时候, YYRHSLOC(rhs,k)返回的是刚刚被归约的符号的位置.

当要自己定义宏YYLLOC_DEFAULT的时候,你要考虑以下几点:

所有的参数应该不受左端/右端的限制. 然而,只有第一个(结果)应该被YYLOC_DEFAULT修改.
出于与语义动作一致性的考虑, 右手端有效索引的范围应该是从1到n. 当n是0的时候,只有0是有效索引并且它引用的是归约前的那个符号. 在错误处理中,n总是正数.
因为实际的参数可能不在括号内, 如果需要的话,你应该加参数放在括号内. 同样地,当你的宏后紧跟一个分号时, 它应该被展开成可作为单独语句使用的东西.

--------------------------------------------------------------------------------
[ < ] [ > ] [ << ] [ 上层 ] [ >> ] [顶层] [内容] [索引] [ ? ]
7 Bison声明-Bison Declarations
Bison声明(Bison declarations)部分定义了用来描述语法的符号和语义值的数据类型. 参阅 符号-Symbols.

所有符号类型名称(但不是如'+'和'*'的单字符记号)必须被声明. 如果你要指明非终结符语义值的数据类型的话,那么它们也必须被声明 (参阅多种值类型-More Than One Value Type一章).

默认地,文件的第一个规则也指明了开始符号. 如果你要其它的符号作为开始符号,你必须显示显式地声明它. (参阅语言与上下文无关文法-Language and Context-Free Grammars一章)
7.1 符号类型名称-Token Type Names 声明终结符
3.7.2 操作符优先级-Operator Precedence 声明终结符的优先级和结合性
3.7.3 值类型集-The Collection of Value Types 声明一组语义值类型
3.7.4 非终结符-Nonterminal Symbols 声明非终结语义值的类型
3.7.5 在分析执行前执行一些动作-Performing Actions before Parsing 在分析开始前执行的代码
3.7.6 释放被丢弃的符号-Freeing Discarded Symbols 声明如何释放符号
3.7.7 消除冲突警告-Suppressing Conflict Warnings 消除分析冲突时的警告
3.7.8 开始符号-The Start-Symbol 指明开始符号
3.7.9 纯(可重入)分析器-A Pure (Reentrant) Parser 请求一个可重入的分析器
3.7.10 Bison声明总结-Bison Declaration Summary 一个所有Bison声明的总结

--------------------------------------------------------------------------------
[ < ] [ > ] [ << ] [ 上层 ] [ >> ] [顶层] [内容] [索引] [ ? ]
7.1 符号类型名称-Token Type Names
声明符号类型(终结符)的最基本的方法如下:

%token name

Bison会在分析器中将这个声明转换成#define指令以便yylex(如果在这个文件中使用了它) 可以是用名称name代表这个记号类型码.

另外,如果你要指明结合性和优先级, 你可以使用%left,%right或者%nonassoc 代替%token. 参阅 操作符优先级-Operator Precedence.

你可以依靠附加一个十进制活十六进制整数紧跟着记号名称来显式地指定一个符号类型的数字码.

%token NUM 300
%token XNUM 0x12d // a GNU extension 一个GNU扩展

然而,我们通常最好让Bison选择所有记号类型的数字码. Bison会自动地选择互不冲突或不与其它字符冲突的码.

当栈类型是一个联合体的时候, 你必须使用%token或者其它记号声明来指明记号的语义值类型. 语义值类型由中括号分隔. (参阅多种值类型-More Than One Value Type一章).

例如:

%union { /* define stack type / / 定义栈类型 */
double val;
symrec tptr;
}
%token NUM / define token NUM and its type / / 定义一个记号NUM和它的数据类型 */

将文字串写在%token声明的结尾, 你可以把一个符号类型名称关联到文字串记号上. 例如:

%token arrow "=>"

例如,一个C语言语法可以用同等的文字串记号指明这些名称

%token OR "||"

%token LE 134 "<="
%left OR "<="

一旦你使文字串和符号名称等价, 你可以在以后的声明或者语法规则中交替地使用它们. yylex函数可以使用符号名称或者文字串来获得符号类型数字码. (参阅调用惯例-Calling Convention一章).

--------------------------------------------------------------------------------
[ < ] [ > ] [ << ] [ 上层 ] [ >> ] [顶层] [内容] [索引] [ ? ]
7.2 操作符优先级-Operator Precedence
使用%left,%right或者%nonassoc 可以一次声明一个记号并指明它的优先级和结合性. 这些被称做优先级声明(precedence declarations). 获取更多这方面的信息,参阅 操作符优先级-Operator Precedence.

优先级的声明与%token的声明相同,或者是

%left symbols…

或者是

%left symbols…

这些声明都与%token的目的相同. 但是额外地,它们还指明了symbols的结合性和相对优先级:

操作符的结合性决定了如何重复使用嵌套的操作符: x op y op z' 是先组合x和y,还是先组合y和z. %left指明左结合性(先组合x和y)而 %right指明了有结合性(先组合y和z). %nonassoc指明了无结合性,即x op y op z' 被认为是一个语法错误.
一个操作符的优先级决定了它如何与另外的操作符嵌套使用. 在一个优先级声明中声明的所有记号有相同的优先级, 如何嵌套使用它们取决于它们的结合性. 当两个记号在不同的优先级声明中,稍晚声明的拥有更高的优先级,并且先被组合.

--------------------------------------------------------------------------------
[ < ] [ > ] [ << ] [ 上层 ] [ >> ] [顶层] [内容] [索引] [ ? ]
7.3 值类型集-The Collection of Value Types
%union声明指明了语义值全部可能的数据类型集. 关键字%union后紧跟包含了C语言union同样的东西的一对大括号.

例如:

%union {
double val;
symrec *tptr;
}

这说明了两个可选择的类型是double和symrec*. 它们被赋予了名称val和tptr; 这些名称用于在%toke和%type声明中为终结符或非终结符选择一个类型. (参阅非终结符-Nonterminal Symbols一章).

作为一个POSIX扩展,一个标志被允许紧跟在union后. 例如:

%union value {
double val;
symrec *tptr;
}

指明了联合题标志value,所以相应的C类型为union value. 如果你不知名一个标志,它默认地就为YYSTYPE.

我们应该注意到,并不像C语言中的union声明一样, 在Bison中,你不需要在大括号结束的时候写上分号.

--------------------------------------------------------------------------------
[ < ] [ > ] [ << ] [ 上层 ] [ >> ] [顶层] [内容] [索引] [ ? ]
7.4 非终结符-Nonterminal Symbols
当你使用%union指明多种值类型的时候, 你必须为每个要使用其语义值的非终结符指明一个值类型. 通过%type可以做到这一点,像这样:

%type nonterminal…

这里的nonterminal是非终结符的名称, type是在%union中给定的名称来指定该非终结符的语义值类型. (参阅值类型集-The Collection of Value Types一章). 你可以给任意多数量的非终结符以相同的数据类型, 如果它们有相同的值类型的话. 这时我们要使用空白来分隔符号名称.

你也可以声明一个终结符的值类型. 为终结符使用相同的结构可以做到这一点. 所有种类的记号声明都允许使用.

--------------------------------------------------------------------------------
[ < ] [ > ] [ << ] [ 上层 ] [ >> ] [顶层] [内容] [索引] [ ? ]
7.5 在分析执行前执行一些动作-Performing Actions before Parsing
有些时候,你的分析器需要在分析之前执行一些初始化. 通过使用%initial-action指令指定这种代码.

指令: %initial-action { code }
声明了code必须在每次调用yyparse之前被调用. code可以使用来指明与symbols关联的语义值. 其余的分析器参数也是可用的. (参阅分析器函数yyparse-The Parser Funcation yyparse一章).

警告:对于版本1.875来说,这个特征仍然是实验性的. 主要原因是没有足够的用户反馈. 相应的语法仍可能会改变.

例如：

%union
{
char *string;
}
%token STRING
%type string
%destructor { free (
像一个变量一样工作,这个变量包含了由当前规则构成的组的语义值. 参阅 动作-Actions.

变量: $n
像一个变量一样工作,这个变量包含了当前动作第n个部件的语义值. 参阅 动作-Actions.

变量:
类似
在动作中,规则左端的语义值. 参阅 动作-Actions.

变量: $n
在动作中,规则右端第n个符号的语义值. 参阅 动作-Actions.

分隔符: %%
用于分隔语法规则部分和Bison声明部分或者epilogue部分. 参阅 Bison语法文件的布局-The Overall Layout of a Bison Grammar.

分隔符: %{code%}
在%{'和%}'之间的代码不做任何解释被直接复制到输出文件. 这些代码组成了输入文件的Prologue部分. 参阅 Bison语法的提纲-Outline of a Bison Grammar.

结构: /…/
注释分隔符,类似C.

分隔符: :
分隔动作的结果和它的部件. 参阅 描述语法规则的语法-Syntax of Grammar Rules.

分隔符: ;
结束一个规则. 参阅 描述语法规则的语法-Syntax of Grammar Rules.

分隔符: |
分隔同一个非终结符结果的不同规则. 参阅 描述语法规则的语法-Syntax of Grammar Rules.

符号: accept 预定义非终结符, 它的唯一规则为`accept: start $end', 这里的start是开始符号. 参阅 开始符号- The Start-Symbol. 它不能在语法中使用.

指令: %debug
激活分析器调试. 参阅 声明总结-Decl Summary.

指令: %defines
为扫描器创建一个头文件的Bison声明. 参阅 声明总结-Decl Summary.

指令: %destructor
指明分析器如何回收被丢弃符号相关的内存. 参阅 释放丢弃的符号- Freeing Discarded Symbols.

指令: %dprec
在分析的时候赋予规则一个优先级来解决归约/归约冲突的Bison声明. 参阅 编写GLR分析器-Writing GLR Parsers.

符号: $end
用来标记流结束的预定义记号,不能在语法中使用.

符号: error
一个保留的用于错误恢复的记号名称. 这个记号可以用在语法规则中用来允许Bison分析器在不终止处理的前提下识别一个错误. 实际上,一个包含错误的句子可被认为是有效的. 遇到一个语法错误时, 记号error成为了当前的超前扫描记号. 与error相应的动作被执行,并且超前扫描记号被重置为最初引起错误的记号. 参阅 错误恢复-Error Recovery.

指令: %error-verbose
请求冗长模式的Bison声明, 指明了当调用yyerror时的错误消息字符串.

指令: %file-prefix="prefix"
设置输出文件前缀的Bison声明.参阅 声明总结-Decl Summary.

指令: %glr-parser
声称GLR分析器的Bison声明. 参阅 编写GLR分析器-Writing GLR Parsers.

指令: %initial-action
在分析器前运行代码.参阅 在分析前执行动作- Performing Actions before Parsing.

指令: %left
为操作符指定左结合性的Bison声明. 参阅 操作符优先级-Operator Precedence.

指令: %lex-param {argument-declaration}
指明yylex的额外参数的Bison声明. 参阅 纯分析器的调用惯例-Calling Conventions for Pure Parsers.

指令: %merge
赋予规则一个合并函数的Bison声明. 如果有一个归约/归约冲突的规则带有相同的合并函数, 那么这个函数被应用于两个语义值来获得单一的结果. 参阅 Writing GLR Parsers-编写GLR分析器.

指令: %name-prefix="prefix"
重命名外部符号的Bison声明.参阅 声明总结-Decl Summary.

指令: %no-lines
在分析器文件中避免产生#line指令的Bison声明. 参阅 声明总结-Decl Summary.

指令: %nonassoc
声明一个无结合性记号. 参阅 操作符优先级-Operator Precedence.

指令: %output="filename"
设置分析器文件的Bison声明 参阅 声明总结-Decl Summary.

指令: %parse-param {argument-declaration}
指定yyparse接受的额外参数的Bison声明. 参阅 分析器函数yyparse- The Parser Function yyparse.

指令: %prec
给特定的规则指定优先级的Bison声明. 参阅 上下文依赖优先级-Context-Dependent Precedence.

指令: %pure-parser
请求一个纯(可重入)分析器的Bison声明. 参阅 一个纯(可重入)分析器-A Pure (Reentrant) Parser.

指令: %right
指定记号右结合性的Bison声明. 参阅 操作符优先级-Operator Precedence.

指令: %start
指定开始符号的Bison声明参阅 开始符号-The Start-Symbol.

指令: %token
声明记号但不指定优先级. 参阅 记号类型名称-Token Type Names.

指令: %token-table
在分析器文件中加入符号名称表的Bison声明. 参阅 声明总结-Decl Summary.

指令: %type
声明非终结符的Bison声明. 参阅 非终结符-Nonterminal Symbols.

符号: $undefined
所有yylex返回的未定义值被映射到这个预定义符号. 它不能在语法中使用,[untranslated]rather,use error.

指令: %union
指定多种可能语义值数据类型的Bison声明. 参阅 值类型集-The Collection of Value Types.

宏: YYABORT
通过使yyparse立即返回1,来伪装发生一个未恢复的语法错误的宏. 并不调用错误报告函数yyerrpr. 参阅 分析器函数ppyarse-The Parser Function yyparse.

宏: YYACCEPT
通过使yyparse立即返回0,来伪装语言的一个完整的表达已经被读取的宏. 参阅 分析器函数ppyarse-The Parser Function yyparse.

宏: YYBACKUP
从分析器栈中丢弃一个值并伪造一个超前扫描记号的宏. 参阅 在动作中使用的特殊特征-Special Features for Use in Actions.

变量: yychar
包含当前超前扫描记号的正数值的外部整数变量. (在一个纯分析器中,它是一个在yyparse中的局部变量). 错误恢复规则可能要检查这个变量. 参阅 在动作中使用的特殊特征-Special Features for Use in Actions.

变量: yyclearin
在错误恢复规则中使用的宏.它清除先前的超前扫描记号. 参阅 错误恢复-Error Recovery.

宏: YYDEBUG
使分析器带有追踪代码的宏. 参阅 跟踪你的分析器-Tracing Your Parser.

变量: yydebug
默认被置0的外部整数变量. 如果yydebug被赋予一个非零值, 分析器会输入关于输入符号和分析器动作的信息. 参阅 跟踪你的分析器-Tracing Your Parser.

宏: yyerrok
使分析器在一个语法错误之后立即恢复到正常模式的宏. 参阅 错误恢复-Error Recovery.

宏: YYERROR
一个假装刚刚发现一个语法错误的宏: 调用yyerror然后执行通常的错误恢复如果可能的话(参阅错误恢复-Error Recovery一章) 或者(如果恢复是不可能的)使yyparse返回1. 参阅 错误恢复-Error Recovery.

函数: yyerror
用户提供的当发现错误时被yyparse调用的函数. 参阅 错误报告函数yyerror-The Error Reporting Function yyerror.

宏: YYERROR_VERBOSE
一个在Prologue部分用#define定义的陈旧的宏, 当调用yyerror时,它请求详细的错误消息字符串. 你把YYERROR_VERBOSE定义成什么东西并没有影响, 有影响的只是你是否定义了它. 使用%error-verbose是更好的选择.

宏: YYINITDEPTH
指定分析器栈初始大小的宏. 参阅 栈溢出-Stack Overflow.

函数: yylex
用户提供的词法分析器函数, 不带有任何参数来获得下一个记号. 参阅 词法分析器函数yylex-The Lexical Analyzer Function yylex.

宏: YYLEX_PARAM
一个用于指明yyparse传递到yylex的额外参数(或者额外参数列表)的陈旧的宏. 不赞成继续使用这个宏,它只被Yacc类似分析器支持. 参阅 纯分析器的调用惯例-Calling Conventions for Pure Parsers.

变量: yylloc
yylex应该将一个记号的行列号放入这个外部变量. (在纯分析器中,它是一个yyparse的局部变量, 它的地址被传递到yylex). 如果你在语法动作中不使用`@'特性,你可以忽略这个变量. 参阅 记号的文字位置-Textual Locations of Tokens.

Type: YYLTYPE
yyloc的数据类型;默认地为一个带有四个成员的结构体. 参阅 位置的数据类型-Data Types of Locations.

变量: yylval
yylex应该将记号相关的语义值放入这个变量. (在纯分析器中,它是一个yyparse中的局部变量,并且它的地址被传递到yylex.) 参阅 记号的语义值-Semantic Values of Tokens.

宏: YYMAXDEPTH
指明分析器栈最大容的宏. 参阅 栈溢出-Stack Overflow.

变量: yynerrs
一个全局变量,每次出现语法错误时自增1. (在纯分析器中,它是一个yyparse中的局部变量.) 参阅 错误报告函数yyerror-The Error Reporting Function yyerror.

函数: yyparse
Bison产生的分析器函数;调用这个函数开始分析. 参阅 分析器函数yyparse-The Parser Function yyparse.

宏: YYPARSE_PARAM
指明yyparse应该接受的参数名成的陈旧宏. 不赞成继续使用这个宏,它只被Yacc类似分析器支持. 参阅 纯分析器的调用惯例-Calling Conventions for Pure Parsers.

宏: YYRECOVERING
一个宏,它的值指明了分析器是否正在从错误中恢复. 参阅 动作中使用的特殊特征-Special Features for Use in Actions.

宏: YYSTACK_USE_ALLOCA
用于控制当C语言LALR(1)分析器需要扩展它的栈时,alloca的使用. 如果定义为0,分析器会使用malloc来扩展它的栈. 如果定义为1,分析器则会使用alloca. 除了0和1以外的值保留用于Bison以后的扩展. 如果没有被定义, YYSTACK_USA_ALLOCA默认为0.

如果你定义YYSTACK_USE_ALLOCA为1, 你有责任使alloca是可见的, 例如,使用GCC,或者包含<stdlib.h>. 此外,在更普通的情况下, 如果你的代码可能运行在一个有限栈容量和不可信任栈溢出检查的主机上的时候, 你应将YYMAXDEPTH设为当调用alloca时, 在一个在任何目标主机不会产生栈溢出的值. 你可以检查Bison生成的代码来决定适当的数值. 这需要在底层详细实现的专业技术.

类型: YYSTYPE
语义值的数据类型;默认为int. 参阅 语义值的数据类型-Data Types of Semantic Values.

--------------------------------------------------------------------------------
[ < ] [ > ] [ << ] [ 上层 ] [ >> ] [顶层] [内容] [索引] [ ? ]

B. 词汇表-Glossary
Backus-Naur Form (BNF; also called "Backus Normal Form")
Backus-Naur 范式 (BNF; 也被称为 "Backus正规范式")
由John Backus倡导的,最初用于描述上下文无关文法的正式方法. 在Peter Naur他的称为Algol60报告的1960-01-02委员会文档中得到少许改进. 参阅 语言与上下文无关文法-Languages and Context-Free Grammars.

Context-free grammars
上下文无关文法
描述可以使用而不考虑上下文的规则的文法. 因此,如果有一个规则说一个整数可做为一个表达式使用, 那么,整数在任何地方都是一个允许的表达式. 参阅 语言与上下文无关文法-Languages and Context-Free Grammars.

Dynamic allocation
动态分配
在执行期间分配内存,而不是在编译期间或者进入一个函数时.

Empty string
空字符串
模拟集合论中的空集, 空字符串是长度为0的字符串.

Finite-state stack machine
有限状态栈机
一种含有多种离散状态的机器,每个时刻只有一种状态. 当处理输入的时候,机器按照机器逻辑的指定从一个状态转换到另一个状态. 对于分析器来说,输入就是要分析的语言, 状态对应于语法规则中的各个阶段. 参阅 Bison分析器算法-The Bison Parser Algorithm.

Generalized LR (GLR)
通用LR (GLR)
一种可以处理包括那些不是LALR(1)的上下文无关文法的分析算法. 它用来解决Bison通常的LALR(1)算法不能解决的冲突. 它高效地分裂成多个分析器,尝试所有可能的分析,丢弃那些在额外上下文提示下失败的分析器. 参阅 通用LR分析-Generalized LR Parsing.

Grouping
分组
一个(通常)在语法上可再分的语言结构; 例如C中的`expression'或者'declaration'. 参阅 语言和上下文无关文法-Languages and Context-Free Grammars.

Infix operator
中缀操作符
放置在操作数中间指定某些操作的算术操作符.

Input stream
输入流
在设备或程序间的连续数据流.

Language construct
语言结构
一种语言的典型应用模式. 例如,一种C语言的结构是if语句. 参阅 语言和上下文无关文法-Languages and Context-Free Grammars.

Left associativity
左结合性
拥有左结合性的操作符被从左至右地分析: a+b+C'首先计算a+b'然后和`c'一起计算. 参阅 操作符优先级-Operator Precedence.

Left recursion
左递归
一个结果符号同样是第一个部件符号的规则; 例如: `expseq1 : expseq1 ',' exp;'. 参阅 递归规则-Recursive Rules.

Left-to-right parsing
自左至右分析
同过自左至右分析一个个地分析记号来分析一个句子. 参阅 Bison 分析器算法-The Bison Parser Algorithm.

Lexical analyzer (scanner)
词法分析器 (扫描器)
一个读取输入流并逐个返回记号的函数. 参阅 词法分析器函数yylex-The Lexical Analyzer Function yylex.

Lexical tie-in
词法关联
一个由语法规则动作设置的标志用来改变分析记号的方法. 参阅 词法关联-Lexical tie-in.

Literal string token
字符串文字记号
一个由两个或者更多字符组成的记号.参阅 符号-Symbols.

Look-ahead token
超前扫描记号
一个已经读取但未移进的记号. 参阅 超前扫描记号-Look-Ahead Tokens.

LALR(1)
一种Bison(像大多数其它分析器一样)可以处理的上下文无关文法. LR(1)的子集. 参阅 令人迷惑的归约/归约冲突-Mysterious Reduce/Reduce Conflicts.

LR(1)
一种上下文无关文法, 它在大多数时侯需要一个超前扫描记号来消除任何输入片段的歧义.

Nonterminal symbol
非终结符
一个代表可以通过规则表达为更小结构的语法结构; 换句话说,一个不是记号的结构. 参阅 符号-Symbols.

Parser
分析器
一个靠分析从词法分析器传递过来的记号的语法结构来识别有效句子的函数.

Postfix operator
后缀操作符
放置在操作数后执行某些操作的算术操作符.

Reduction
归约
依照一个语法规则将非终结符和/或终结符的序列替换为非终结符. 参阅 Bison分析器算法-The Bison Parser Algorithm.

Reentrant
可重入
一个可重入的子程序是一个可以被任意次地并行调用并且调用间相互不干扰的子程序. 参阅 一个纯(可重入)分析器-A Pure (Reentrant) Parser.

Reverse polish notation
逆波兰记号
一种所有操作符都是后缀操作符的语言.

Right recursion
右递归
一个结果记号也是它最后部件记号的规则; 例如 `expseq1: exp ',' expseq1;'. 参阅 递归规则-Recursive rules.

Semantics-语义
在计算机语言中,语义由每个语言实例的动作指明, 例如,每个语句的意义. 参阅 定义语言的语义-Defining Language Semantics.

Shift-移进
我们说一个分析器移进当它决定进从流中进一步分析输入而不是立即归约一些已经识别的规则. 参阅 Bison分析器算法-The Bison Parser Algorithm.

Single-character literal
单字符文字
一个被识别和解释为它自己的单一字符. 参阅 从正规文法转换到Bison输入-From Formal Rules to Bison Input.

Start symbol
开始符号
代表要分析语言的一个完整有效的表述的非终结符. 在语言描述中,开始符号通常被列为第一个非终结符. 参阅 开始符号-The Start-Symbol.

Symbol table
符号表
用来识别和使用已经存在的符号信息的数据结构. 在进行分析器符号表存储符号名称和相关数据. 参阅 多功能计算器-Multi-function Calc.

Syntax error
语法错误
一个发生在分析无效语法的输入流时的错误. 参阅 错误恢复-Error Recovery.

Token
记号
一个基本的不可再分的语言单元. 在语法中,描述一个记号的符号是终结符. Bison分析器的输入是来自词法分析器的记号流. 参阅 Symbols-符号.

Terminal symbol
终结符
在语法中不包含含规则因此语法上不可再分的语法符号. 它表示的输入片段是一个记号. 参阅 语言与上下文无关文法-Languages and Context-Free Grammars.

--------------------------------------------------------------------------------
[ < ] [ > ] [ << ] [ 上层 ] [ >> ] [顶层] [内容] [索引] [ ? ]

C. 复制这个手册-Copying This Manual
C.1 GNU Free Documentation License 复制这个手册的许可.

--------------------------------------------------------------------------------
[ < ] [ > ] [ << ] [ 上层 ] [ >> ] [顶层] [内容] [索引] [ ? ]

C.1 GNU Free Documentation License
Version 1.2, November 2002

Copyright © 2000,2001,2002 Free Software Foundation, Inc.
59 Temple Place, Suite 330, Boston, MA 02111-1307, USA

Everyone is permitted to copy and distribute verbatim copies
of this license document, but changing it is not allowed.

PREAMBLE
The purpose of this License is to make a manual, textbook, or other functional and useful document free in the sense of freedom: to assure everyone the effective freedom to copy and redistribute it, with or without modifying it, either commercially or noncommercially. Secondarily, this License preserves for the author and publisher a way to get credit for their work, while not being considered responsible for modifications made by others.

This License is a kind of "copyleft", which means that derivative works of the document must themselves be free in the same sense. It complements the GNU General Public License, which is a copyleft license designed for free software.

We have designed this License in order to use it for manuals for free software, because free software needs free documentation: a free program should come with manuals providing the same freedoms that the software does. But this License is not limited to software manuals; it can be used for any textual work, regardless of subject matter or whether it is published as a printed book. We recommend this License principally for works whose purpose is instruction or reference.

APPLICABILITY AND DEFINITIONS
This License applies to any manual or other work, in any medium, that contains a notice placed by the copyright holder saying it can be distributed under the terms of this License. Such a notice grants a world-wide, royalty-free license, unlimited in duration, to use that work under the conditions stated herein. The "Document", below, refers to any such manual or work. Any member of the public is a licensee, and is addressed as "you". You accept the license if you copy, modify or distribute the work in a way requiring permission under copyright law.

A "Modified Version" of the Document means any work containing the Document or a portion of it, either copied verbatim, or with modifications and/or translated into another language.

A "Secondary Section" is a named appendix or a front-matter section of the Document that deals exclusively with the relationship of the publishers or authors of the Document to the Document's overall subject (or to related matters) and contains nothing that could fall directly within that overall subject. (Thus, if the Document is in part a textbook of mathematics, a Secondary Section may not explain any mathematics.) The relationship could be a matter of historical connection with the subject or with related matters, or of legal, commercial, philosophical, ethical or political position regarding them.

The "Invariant Sections" are certain Secondary Sections whose titles are designated, as being those of Invariant Sections, in the notice that says that the Document is released under this License. If a section does not fit the above definition of Secondary then it is not allowed to be designated as Invariant. The Document may contain zero Invariant Sections. If the Document does not identify any Invariant Sections then there are none.

The "Cover Texts" are certain short passages of text that are listed, as Front-Cover Texts or Back-Cover Texts, in the notice that says that the Document is released under this License. A Front-Cover Text may be at most 5 words, and a Back-Cover Text may be at most 25 words.

A "Transparent" copy of the Document means a machine-readable copy, represented in a format whose specification is available to the general public, that is suitable for revising the document straightforwardly with generic text editors or (for images composed of pixels) generic paint programs or (for drawings) some widely available drawing editor, and that is suitable for input to text formatters or for automatic translation to a variety of formats suitable for input to text formatters. A copy made in an otherwise Transparent file format whose markup, or absence of markup, has been arranged to thwart or discourage subsequent modification by readers is not Transparent. An image format is not Transparent if used for any substantial amount of text. A copy that is not "Transparent" is called "Opaque".

Examples of suitable formats for Transparent copies include plain ASCII without markup, Texinfo input format, LaTeX input format, SGML or XML using a publicly available DTD, and standard-conforming simple HTML, PostScript or PDF designed for human modification. Examples of transparent image formats include PNG, XCF and JPG. Opaque formats include proprietary formats that can be read and edited only by proprietary word processors, SGML or XML for which the DTD and/or processing tools are not generally available, and the machine-generated HTML, PostScript or PDF produced by some word processors for output purposes only.

The "Title Page" means, for a printed book, the title page itself, plus such following pages as are needed to hold, legibly, the material this License requires to appear in the title page. For works in formats which do not have any title page as such, "Title Page" means the text near the most prominent appearance of the work's title, preceding the beginning of the body of the text.

A section "Entitled XYZ" means a named subunit of the Document whose title either is precisely XYZ or contains XYZ in parentheses following text that translates XYZ in another language. (Here XYZ stands for a specific section name mentioned below, such as "Acknowledgements", "Dedications", "Endorsements", or "History".) To "Preserve the Title" of such a section when you modify the Document means that it remains a section "Entitled XYZ" according to this definition.

The Document may include Warranty Disclaimers next to the notice which states that this License applies to the Document. These Warranty Disclaimers are considered to be included by reference in this License, but only as regards disclaiming warranties: any other implication that these Warranty Disclaimers may have is void and has no effect on the meaning of this License.

VERBATIM COPYING
You may copy and distribute the Document in any medium, either commercially or noncommercially, provided that this License, the copyright notices, and the license notice saying this License applies to the Document are reproduced in all copies, and that you add no other conditions whatsoever to those of this License. You may not use technical measures to obstruct or control the reading or further copying of the copies you make or distribute. However, you may accept compensation in exchange for copies. If you distribute a large enough number of copies you must also follow the conditions in section 3.

You may also lend copies, under the same conditions stated above, and you may publicly display copies.

COPYING IN QUANTITY
If you publish printed copies (or copies in media that commonly have printed covers) of the Document, numbering more than 100, and the Document's license notice requires Cover Texts, you must enclose the copies in covers that carry, clearly and legibly, all these Cover Texts: Front-Cover Texts on the front cover, and Back-Cover Texts on the back cover. Both covers must also clearly and legibly identify you as the publisher of these copies. The front cover must present the full title with all words of the title equally prominent and visible. You may add other material on the covers in addition. Copying with changes limited to the covers, as long as they preserve the title of the Document and satisfy these conditions, can be treated as verbatim copying in other respects.

If the required texts for either cover are too voluminous to fit legibly, you should put the first ones listed (as many as fit reasonably) on the actual cover, and continue the rest onto adjacent pages.

If you publish or distribute Opaque copies of the Document numbering more than 100, you must either include a machine-readable Transparent copy along with each Opaque copy, or state in or with each Opaque copy a computer-network location from which the general network-using public has access to download using public-standard network protocols a complete Transparent copy of the Document, free of added material. If you use the latter option, you must take reasonably prudent steps, when you begin distribution of Opaque copies in quantity, to ensure that this Transparent copy will remain thus accessible at the stated location until at least one year after the last time you distribute an Opaque copy (directly or through your agents or retailers) of that edition to the public.

It is requested, but not required, that you contact the authors of the Document well before redistributing any large number of copies, to give them a chance to provide you with an updated version of the Document.

MODIFICATIONS
You may copy and distribute a Modified Version of the Document under the conditions of sections 2 and 3 above, provided that you release the Modified Version under precisely this License, with the Modified Version filling the role of the Document, thus licensing distribution and modification of the Modified Version to whoever possesses a copy of it. In addition, you must do these things in the Modified Version:

Use in the Title Page (and on the covers, if any) a title distinct from that of the Document, and from those of previous versions (which should, if there were any, be listed in the History section of the Document). You may use the same title as a previous version if the original publisher of that version gives permission.
List on the Title Page, as authors, one or more persons or entities responsible for authorship of the modifications in the Modified Version, together with at least five of the principal authors of the Document (all of its principal authors, if it has fewer than five), unless they release you from this requirement.
State on the Title page the name of the publisher of the Modified Version, as the publisher.
Preserve all the copyright notices of the Document.
Add an appropriate copyright notice for your modifications adjacent to the other copyright notices.
Include, immediately after the copyright notices, a license notice giving the public permission to use the Modified Version under the terms of this License, in the form shown in the Addendum below.
Preserve in that license notice the full lists of Invariant Sections and required Cover Texts given in the Document's license notice.
Include an unaltered copy of this License.
Preserve the section Entitled "History", Preserve its Title, and add to it an item stating at least the title, year, new authors, and publisher of the Modified Version as given on the Title Page. If there is no section Entitled "History" in the Document, create one stating the title, year, authors, and publisher of the Document as given on its Title Page, then add an item describing the Modified Version as stated in the previous sentence.
Preserve the network location, if any, given in the Document for public access to a Transparent copy of the Document, and likewise the network locations given in the Document for previous versions it was based on. These may be placed in the "History" section. You may omit a network location for a work that was published at least four years before the Document itself, or if the original publisher of the version it refers to gives permission.
For any section Entitled "Acknowledgements" or "Dedications", Preserve the Title of the section, and preserve in the section all the substance and tone of each of the contributor acknowledgements and/or dedications given therein.
Preserve all the Invariant Sections of the Document, unaltered in their text and in their titles. Section numbers or the equivalent are not considered part of the section titles.
Delete any section Entitled "Endorsements". Such a section may not be included in the Modified Version.
Do not retitle any existing section to be Entitled "Endorsements" or to conflict in title with any Invariant Section.
Preserve any Warranty Disclaimers.
If the Modified Version includes new front-matter sections or appendices that qualify as Secondary Sections and contain no material copied from the Document, you may at your option designate some or all of these sections as invariant. To do this, add their titles to the list of Invariant Sections in the Modified Version's license notice. These titles must be distinct from any other section titles.

You may add a section Entitled "Endorsements", provided it contains nothing but endorsements of your Modified Version by various parties--for example, statements of peer review or that the text has been approved by an organization as the authoritative definition of a standard.

You may add a passage of up to five words as a Front-Cover Text, and a passage of up to 25 words as a Back-Cover Text, to the end of the list of Cover Texts in the Modified Version. Only one passage of Front-Cover Text and one of Back-Cover Text may be added by (or through arrangements made by) any one entity. If the Document already includes a cover text for the same cover, previously added by you or by arrangement made by the same entity you are acting on behalf of, you may not add another; but you may replace the old one, on explicit permission from the previous publisher that added the old one.

The author(s) and publisher(s) of the Document do not by this License give permission to use their names for publicity for or to assert or imply endorsement of any Modified Version.

COMBINING DOCUMENTS
You may combine the Document with other documents released under this License, under the terms defined in section 4 above for modified versions, provided that you include in the combination all of the Invariant Sections of all of the original documents, unmodified, and list them all as Invariant Sections of your combined work in its license notice, and that you preserve all their Warranty Disclaimers.

The combined work need only contain one copy of this License, and multiple identical Invariant Sections may be replaced with a single copy. If there are multiple Invariant Sections with the same name but different contents, make the title of each such section unique by adding at the end of it, in parentheses, the name of the original author or publisher of that section if known, or else a unique number. Make the same adjustment to the section titles in the list of Invariant Sections in the license notice of the combined work.

In the combination, you must combine any sections Entitled "History" in the various original documents, forming one section Entitled "History"; likewise combine any sections Entitled "Acknowledgements", and any sections Entitled "Dedications". You must delete all sections Entitled "Endorsements."

COLLECTIONS OF DOCUMENTS
You may make a collection consisting of the Document and other documents released under this License, and replace the individual copies of this License in the various documents with a single copy that is included in the collection, provided that you follow the rules of this License for verbatim copying of each of the documents in all other respects.

You may extract a single document from such a collection, and distribute it individually under this License, provided you insert a copy of this License into the extracted document, and follow this License in all other respects regarding verbatim copying of that document.

AGGREGATION WITH INDEPENDENT WORKS
A compilation of the Document or its derivatives with other separate and independent documents or works, in or on a volume of a storage or distribution medium, is called an "aggregate" if the copyright resulting from the compilation is not used to limit the legal rights of the compilation's users beyond what the individual works permit. When the Document is included in an aggregate, this License does not apply to the other works in the aggregate which are not themselves derivative works of the Document.

If the Cover Text requirement of section 3 is applicable to these copies of the Document, then if the Document is less than one half of the entire aggregate, the Document's Cover Texts may be placed on covers that bracket the Document within the aggregate, or the electronic equivalent of covers if the Document is in electronic form. Otherwise they must appear on printed covers that bracket the whole aggregate.

TRANSLATION
Translation is considered a kind of modification, so you may distribute translations of the Document under the terms of section 4. Replacing Invariant Sections with translations requires special permission from their copyright holders, but you may include translations of some or all Invariant Sections in addition to the original versions of these Invariant Sections. You may include a translation of this License, and all the license notices in the Document, and any Warranty Disclaimers, provided that you also include the original English version of this License and the original versions of those notices and disclaimers. In case of a disagreement between the translation and the original version of this License or a notice or disclaimer, the original version will prevail.

If a section in the Document is Entitled "Acknowledgements", "Dedications", or "History", the requirement (section 4) to Preserve its Title (section 1) will typically require changing the actual title.

TERMINATION
You may not copy, modify, sublicense, or distribute the Document except as expressly provided for under this License. Any other attempt to copy, modify, sublicense or distribute the Document is void, and will automatically terminate your rights under this License. However, parties who have received copies, or rights, from you under this License will not have their licenses terminated so long as such parties remain in full compliance.

FUTURE REVISIONS OF THIS LICENSE
The Free Software Foundation may publish new, revised versions of the GNU Free Documentation License from time to time. Such new versions will be similar in spirit to the present version, but may differ in detail to address new problems or concerns. See http://www.gnu.org/copyleft/.

Each version of the License is given a distinguishing version number. If the Document specifies that a particular numbered version of this License "or any later version" applies to it, you have the option of following the terms and conditions either of that specified version or of any later version that has been published (not as a draft) by the Free Software Foundation. If the Document does not specify a version number of this License, you may choose any version ever published (not as a draft) by the Free Software Foundation.

--------------------------------------------------------------------------------
[ < ] [ > ] [ << ] [ 上层 ] [ >> ] [顶层] [内容] [索引] [ ? ]

C.1.1 ADDENDUM: How to use this License for your documents
To use this License in a document you have written, include a copy of the License in the document and put the following copyright and license notices just after the title page:

Copyright (C) year your name.
Permission is granted to copy, distribute and/or modify this document
under the terms of the GNU Free Documentation License, Version 1.2
or any later version published by the Free Software Foundation;
with no Invariant Sections, no Front-Cover Texts, and no Back-Cover Texts.
A copy of the license is included in the section entitled ``GNU
Free Documentation License''.

If you have Invariant Sections, Front-Cover Texts and Back-Cover Texts, replace the "with...Texts." line with this:

with the Invariant Sections being list their titles, with
the Front-Cover Texts being list, and with the Back-Cover Texts
being list.

If you have Invariant Sections without Cover Texts, or some other combination of the three, merge those two alternatives to suit the situation.

If your document contains nontrivial examples of program code, we recommend releasing these examples in parallel under your choice of free software license, such as the GNU General Public License, to permit their use in free software.

--------------------------------------------------------------------------------
[ < ] [ > ] [ << ] [ 上层 ] [ >> ] [顶层] [内容] [索引] [ ? ]

索引-Index
跳转到: � � � � � � � � � � � � � � � � � � � � � � � � � � � � �
A B C E F G I L M P R
索引项 部分

--------------------------------------------------------------------------------

�
被丢弃的符号(discarded symbols) 3.7.6 释放被丢弃的符号-Freeing Discarded Symbols
编写一个词法分析器(writing a lexical analyzer) 2.1.3 rpcalc的词法分析器-The rpcalc Lexical Analyzer
编译分析器(compiling the parser) 2.1.7 编译分析器文件-Compiling the Parser File

--------------------------------------------------------------------------------

�
波兰记号计算器(polish notation calculator) 2.1 逆波兰记号计算器-Reverse Polish Notation Calculator
不确定性分析(non-deterministic parsing) 5.8 通用LR (GLR)分析-Generalized LR (GLR) Parsing
操作符的优先级(precedence of operators) 5.3 操作符优先级-Operator Precedence
操作符优先级(operator precedence) 5.3 操作符优先级-Operator Precedence
操作符优先级(operator precedence), 声明(declaring) 3.7.2 操作符优先级-Operator Precedence

--------------------------------------------------------------------------------

�
常见问题(frequently asked questions) 超前扫描记号(look-ahead token) 5.1 超前扫描记号-Look-Ahead Tokens
冲突(conflicts) 1.5 编写GLR分析器-Writing GLR Parsers
冲突(conflicts) 1.5.1 使用GLR分析器分析非歧义文法
冲突(conflicts) 5.2 移进/归约冲突-Shift/Reduce Conflicts
冲突(conflicts), 归约/归约(reduce/reduce) 5.6 归约/归约冲突-Reduce/Reduce Conflicts
冲突(conflicts), 消除警告(suppressing warnings of) 3.7.7 消除冲突警告-Suppressing Conflict Warnings
抽象语法树(abstract syntax tree) 10.5 实现跳转/循环-Implementing Gotos/Loops

--------------------------------------------------------------------------------

�
纯分析器(pure parser) 3.7.9 纯(可重入)分析器-A Pure (Reentrant) Parser
词法分析器(lexical analyzer) 4.2 词法分析器函数yylex-The Lexical Analyzer Function yylex
词法分析器(lexical analyzer), 编写(writing) 2.1.3 rpcalc的词法分析器-The rpcalc Lexical Analyzer
词法分析器(lexical analyzer), 目的(purpose) 1.7 Bison的输出:分析器文件-Bison Output: the Parser File
词法关联(lexical tie-in) 7.2 词法关联-Lexical Tie-ins
词汇表(glossary) B. 词汇表-Glossary
从错误中恢复(recovery from errors) 6. 错误恢复-Error Recovery
从语言接口(C-language interface) 4. 分析器C语言接口-Parser C-Language Interface
错误报告的规则(error reporting routine) 2.1.5 错误报告的规则-The Error Reporting Routine
错误报告函数(error reporting function) 4.3 错误报告函数yyerror-The Error Reporting Function yyerror
错误恢复(error recovery) 6. 错误恢复-Error Recovery
错误恢复(error recovery), 简单(simple) 2.3 简单的错误恢复-Simple Error Recovery

--------------------------------------------------------------------------------

�
单字符文字(single-character literal) 3.2 符号,终结符和非终结符-Symbols, Terminal and Nonterminal
递归规则(recursive rule) 3.4 递归规则-Recursive Rules
调试(debugging) 8.2 跟踪你的分析器-Tracing Your Parser
调用Bison(invoking Bison) 9. 调用Bison-Invoking Bison

--------------------------------------------------------------------------------

�
定义语言的语义(defining language semantics) 3.5 定义语言的语义-Defining Language Semantics
动作(action) 3.5.3 动作-Actions
动作(actions), 位置(location) 3.6.2 动作和位置-Actions and Locations
动作(actions), 语义(semantic) 1.4 语义动作
动作数据类型(action data types) 3.5.4 动作中值的数据类型-Data Types of Values in Actions
动作特征总结(action features summary) 4.4 在动作中使用的特殊特征-Special Features for Use in Actions
动作中的数据类型(data types in actions) 3.5.4 动作中值的数据类型-Data Types of Values in Actions
多功能计算器(multi-function calculator) 2.5 多功能计算器:mfcalc-Multi-Function Calculator: mfcalc
多字符文字(multicharacter literal) 3.2 符号,终结符和非终结符-Symbols, Terminal and Nonterminal
额外C代码部分(additional C code section) 3.1.4 Epilogue部分-The epilogue

--------------------------------------------------------------------------------

�
非确定性分析(non-deterministic parsing) 1.1 语言与上下文无关文法-Languages and Context-Free Grammars
非终结符(nonterminal symbol) 3.2 符号,终结符和非终结符-Symbols, Terminal and Nonterminal
非终结符(nonterminal), 没用处(useless) 8.1 理解你的分析器-Understanding Your Parser
分析错误(parse error) 4.3 错误报告函数yyerror-The Error Reporting Function yyerror
分析器(parser) 1.7 Bison的输出:分析器文件-Bison Output: the Parser File
分析器的算法(algorithm of parser) 5. Bison分析器算法-The Bison Parser Algorithm
分析器栈(parser stack) 5. Bison分析器算法-The Bison Parser Algorithm
分析器栈的溢出(overflow of parser stack) 5.9 栈溢出以及如何避免它-Stack Overflow, and How to Avoid It
分析器栈溢出(parser stack overflow) 5.9 栈溢出以及如何避免它-Stack Overflow, and How to Avoid It
分析器状态(parser state) 5.5 分析器状态-Parser States
符号(symbol) 3.2 符号,终结符和非终结符-Symbols, Terminal and Nonterminal
符号(symbols (abstract)) 1.1 语言与上下文无关文法-Languages and Context-Free Grammars
符号表实例(symbol table example) 2.5.3 mfcalc的符号表-The mfcalc Symbol Table
符号类型(token type) 3.2 符号,终结符和非终结符-Symbols, Terminal and Nonterminal
符号类型名称(token type names), 声明(declaring) 3.7.1 符号类型名称-Token Type Names

--------------------------------------------------------------------------------

�
规则(rule), 没用处(useless) 8.1 理解你的分析器-Understanding Your Parser
规则(rule), 指明的(pointed) 8.1 理解你的分析器-Understanding Your Parser
规则语法(rule syntax) 3.3 描述语法规则的语法-Syntax of Grammar Rules
规则中动作(mid-rule actions) 3.5.5 规则中的动作-Actions in Mid-Rule
归约(reduction) 5. Bison分析器算法-The Bison Parser Algorithm
归约/归约 冲突(reduce/reduce conflicts) 1.5 编写GLR分析器-Writing GLR Parsers
归约/归约冲突(reduce/reduce conflict) 5.6 归约/归约冲突-Reduce/Reduce Conflicts
归约/归约冲突(reduce/reduce conflicts) 1.5.1 使用GLR分析器分析非歧义文法

--------------------------------------------------------------------------------

�
核心(core), 项目集(item set) 8.1 理解你的分析器-Understanding Your Parser
核心(kernel), 项目集(item set) 8.1 理解你的分析器-Understanding Your Parser

--------------------------------------------------------------------------------

�
计算器(calculator), 多功能(multi-function) 2.5 多功能计算器:mfcalc-Multi-Function Calculator: mfcalc
计算器(calculator), 简单(simple) 2.1 逆波兰记号计算器-Reverse Polish Notation Calculator
计算器(calculator), 位置追踪(location tracking) 2.4 带有位置追踪的计算器:ltcalc-Location Tracking Calculator: ltcalc
计算器(calculator), 中缀符号(infix notation) 2.2 中缀符号计算器:calc-Infix Notation Calculator: calc
记号(token) 1.1 语言与上下文无关文法-Languages and Context-Free Grammars
记号(token), 没用处(useless) 8.1 理解你的分析器-Understanding Your Parser
简单例子的main函数(main function in simple example) 2.1.4 控制函数-The Controlling Function
简单实例(simple examples) 2. 实例-Examples
简介(introduction) Bison简介-Introduction

--------------------------------------------------------------------------------

�
接口(interface) 4. 分析器C语言接口-Parser C-Language Interface
结合性(associativity) 5.3.1 什么时候需要优先级-When Precedence is Needed

--------------------------------------------------------------------------------

�
警告(warnings), 阻止(preventing) 3.7.7 消除冲突警告-Suppressing Conflict Warnings

--------------------------------------------------------------------------------

�
开始符号(start symbol) 1.1 语言与上下文无关文法-Languages and Context-Free Grammars
开始符号(start symbol), (声明)declaring 3.7.8 开始符号-The Start-Symbol
可重入分析器(reentrant parser) 3.7.9 纯(可重入)分析器-A Pure (Reentrant) Parser
控制函数(controlling function) 2.1.4 控制函数-The Controlling Function

--------------------------------------------------------------------------------

�
练习(exercises) 2.6 练习-Exercises

--------------------------------------------------------------------------------

�
没用处的非终结符(useless nonterminal) 8.1 理解你的分析器-Understanding Your Parser
没用处的规则(useless rule) 8.1 理解你的分析器-Understanding Your Parser
没用处的记号(useless token) 8.1 理解你的分析器-Understanding Your Parser

--------------------------------------------------------------------------------

�
默认动作(default action) 3.5.3 动作-Actions
默认开始符号(default start symbol) 3.7.8 开始符号-The Start-Symbol
默认数据类型(default data type) 3.5.1 语义值的数据类型-Data Types of Semantic Values
默认位置类型(default location type) 3.6.1 位置的数据类型-Data Type of Locations
默认栈容量限制(default stack limit) 5.9 栈溢出以及如何避免它-Stack Overflow, and How to Avoid It
逆波兰记号(reverse polish notation) 2.1 逆波兰记号计算器-Reverse Polish Notation Calculator

--------------------------------------------------------------------------------

�
歧义文法(ambiguous grammars) 1.1 语言与上下文无关文法-Languages and Context-Free Grammars
歧义文法(ambiguous grammars) 5.8 通用LR (GLR)分析-Generalized LR (GLR) Parsing

--------------------------------------------------------------------------------

�
上下文无关文法(context-free grammar) 1.1 语言与上下文无关文法-Languages and Context-Free Grammars
上下文依赖优先级(context-dependent precedence) 5.4 上下文依赖优先级-Context-Dependent Precedence
声明(declarations) 3.1.1 Prologue部分-The prologue
声明(declarations), Bison 3.7 Bison声明-Bison Declarations
声明(declarations), Bison(简介)(Bison (introduction)) 3.1.2 Bison Declarations部分-The Bison Declarations Section
声明部分(declarations section) 3.1.1 Prologue部分-The prologue
声明操作符优先级(declaring operator precedence) 3.7.2 操作符优先级-Operator Precedence
声明符号类型名称(declaring token type names) 3.7.1 符号类型名称-Token Type Names
声明开始符号(declaring the start symbol) 3.7.8 开始符号-The Start-Symbol
声明文字串记号(declaring literal string tokens) 3.7.1 符号类型名称-Token Type Names
声明值类型(declaring value types) 3.7.3 值类型集-The Collection of Value Types
声明值类型(declaring value types), 非终结符(nonterminals) 3.7.4 非终结符-Nonterminal Symbols
声明总结(declaration summary) 3.7.10 Bison声明总结-Bison Declaration Summary

--------------------------------------------------------------------------------

�
实例(examples), 简单(simple) 2. 实例-Examples
使用Bison(using Bison) 1.8 使用Bison的流程-Stages in Using Bison 使用Bison的流程(stages in using Bison) 1.8 使用Bison的流程-Stages in Using Bison
释放被丢弃的符号(freeing discarded symbols) 3.7.6 释放被丢弃的符号-Freeing Discarded Symbols

--------------------------------------------------------------------------------

�
通用LR (GLR)分析(generalized LR (GLR) parsing) 5.8 通用LR (GLR)分析-Generalized LR (GLR) Parsing
通用LR(GLR)分析(generalized LR (GLR) parsing) 1.1 语言与上下文无关文法-Languages and Context-Free Grammars
通用LR(GLR)分析(generalized LR (GLR) parsing), 非歧义文法(unambiguous grammars) 1.5.1 使用GLR分析器分析非歧义文法
通用LR分析(generalized LR (GLR) parsing) 1.5 编写GLR分析器-Writing GLR Parsers

--------------------------------------------------------------------------------

�
位置(location) 1.6 位置-Locations
位置(location) 3.6 追踪位置-Tracking Locations
位置(location), 文字的(textual) 3.6 追踪位置-Tracking Locations
位置(location), 原文的(textual) 1.6 位置-Locations
位置的数据类型(data type of locations) 3.6.1 位置的数据类型-Data Type of Locations
位置动作(location actions) 3.6.2 动作和位置-Actions and Locations
位置追踪(location tracking calculator) 2.4 带有位置追踪的计算器:ltcalc-Location Tracking Calculator: ltcalc
文法(grammar), 上下文无关(context-free) 1.1 语言与上下文无关文法-Languages and Context-Free Grammars
文件格式(file format) 1.9 Bison语法文件的整体布局-The Overall Layout of a Bison Grammar
文字串记号(literal string token) 3.2 符号,终结符和非终结符-Symbols, Terminal and Nonterminal
文字记号(literal token) 3.2 符号,终结符和非终结符-Symbols, Terminal and Nonterminal
文字位置(textual location) 3.6 追踪位置-Tracking Locations
问题(questions) 10. 常见问题-Frequently Asked Questions

--------------------------------------------------------------------------------

�
相互递归-mutual recursion 3.4 递归规则-Recursive Rules
项目(item) 8.1 理解你的分析器-Understanding Your Parser
项目集核心(item set core) 8.1 理解你的分析器-Understanding Your Parser
项目集核心(item set core) 8.1 理解你的分析器-Understanding Your Parser
消除冲突警告(suppressing conflict warnings) 3.7.7 消除冲突警告-Suppressing Conflict Warnings

--------------------------------------------------------------------------------

�
悬挂else问题(dangling else) 5.2 移进/归约冲突-Shift/Reduce Conflicts

--------------------------------------------------------------------------------

�
一元操作符优先级(unary operator precedence) 5.4 上下文依赖优先级-Context-Dependent Precedence
移进(shifting) 5. Bison分析器算法-The Bison Parser Algorithm
移进/归约 冲突(shift/reduce conflicts) 1.5 编写GLR分析器-Writing GLR Parsers
移进/归约冲突(shift/reduce conflicts) 1.5.1 使用GLR分析器分析非歧义文法
移进/归约冲突(shift/reduce conflicts) 5.2 移进/归约冲突-Shift/Reduce Conflicts

--------------------------------------------------------------------------------

�
用于语法规则的语法(syntax of grammar rules) 3.3 描述语法规则的语法-Syntax of Grammar Rules
优先级(precedence), 上下文依赖(context-dependent) 5.4 上下文依赖优先级-Context-Dependent Precedence
优先级(precedence), 一元操作符(unary operator) 5.4 上下文依赖优先级-Context-Dependent Precedence
优先级声明(precedence declarations) 3.7.2 操作符优先级-Operator Precedence
有限状态机-finite-state machine 5.5 分析器状态-Parser States
右递归(right recursion) 3.4 递归规则-Recursive Rules
语法(grammar), Bison 1.2 从正规文法转换到Bison的输入-From Formal Rules to Bison Input
语法错误(syntax error) 4.3 错误报告函数yyerror-The Error Reporting Function yyerror
语法的规则部分(rules section for grammar) 3.1.3 语法规则部分-The Grammar Rules Section
语法规则部分(grammar rules section) 3.1.3 语法规则部分-The Grammar Rules Section
语法规则的语法(grammar rule syntax) 3.3 描述语法规则的语法-Syntax of Grammar Rules
语法文件(grammar file) 1.9 Bison语法文件的整体布局-The Overall Layout of a Bison Grammar
语法文件的格式(format of grammar file) 1.9 Bison语法文件的整体布局-The Overall Layout of a Bison Grammar
语法组(syntactic grouping) 1.1 语言与上下文无关文法-Languages and Context-Free Grammars
语言的语义(language semantics), 定义(defining) 3.5 定义语言的语义-Defining Language Semantics
语义动作(semantic actions) 1.4 语义动作
语义值(semantic value) 1.3 语义值-Semantic Values
语义值的数据类型(data types of semantic values) 3.5.1 语义值的数据类型-Data Types of Semantic Values
语义值类型(semantic value type) 3.5.1 语义值的数据类型-Data Types of Semantic Values

--------------------------------------------------------------------------------

�
原文位置(textual location) 1.6 位置-Locations
运行Bison(简介)(running Bison (introduction)) 2.1.6 运行Bison来产生分析器-Running Bison to Make the Parser
在规则中的动作(actions in mid-rule) 3.5.5 规则中的动作-Actions in Mid-Rule

--------------------------------------------------------------------------------

�
栈(stack), 分析器(parser) 5. Bison分析器算法-The Bison Parser Algorithm
栈溢出(stack overflow) 5.9 栈溢出以及如何避免它-Stack Overflow, and How to Avoid It
正规文法(formal grammar) 1.2 从正规文法转换到Bison的输入-From Formal Rules to Bison Input

--------------------------------------------------------------------------------

�
值(value), 语义(semantic) 1.3 语义值-Semantic Values
值类型(value type), 语义(semantic) 3.5.1 语义值的数据类型-Data Types of Semantic Values
值类型(value types), 非终结符(nonterminals), 声明(declaring) 3.7.4 非终结符-Nonterminal Symbols
值类型(value types), 声明(declaring) 3.7.3 值类型集-The Collection of Value Types
指明规则(pointed rule) 8.1 理解你的分析器-Understanding Your Parser
中缀符号计算器(infix notation calculator) 2.2 中缀符号计算器:calc-Infix Notation Calculator: calc
终结符(terminal symbol) 3.2 符号,终结符和非终结符-Symbols, Terminal and Nonterminal

--------------------------------------------------------------------------------

�
状态(分析器的)(state (of parser)) 5.5 分析器状态-Parser States
追踪分析器(tracing the parser) 8.2 跟踪你的分析器-Tracing Your Parser
字符串记号(string token) 3.2 符号,终结符和非终结符-Symbols, Terminal and Nonterminal
字符记号(character token) 3.2 符号,终结符和非终结符-Symbols, Terminal and Nonterminal
总结(summary), Bison声明(Bison declaration) 3.7.10 Bison声明总结-Bison Declaration Summary
总结(summary), 动作特征(action features) 4.4 在动作中使用的特殊特征-Special Features for Use in Actions
阻止有关冲突的警告(preventing warnings about conflicts) 3.7.7 消除冲突警告-Suppressing Conflict Warnings
组合(grouping),语法的(syntactic) 1.1 语言与上下文无关文法-Languages and Context-Free Grammars
左递归(left recursion) 3.4 递归规则-Recursive Rules

--------------------------------------------------------------------------------

A
AST 10.5 实现跳转/循环-Implementing Gotos/Loops

--------------------------------------------------------------------------------

B
Backus-Naur 范式(Backus-Naur form) 1.1 语言与上下文无关文法-Languages and Context-Free Grammars
Bison的调用选项(options for invoking Bison) 9. 调用Bison-Invoking Bison
Bison调用(Bison invocation) 9. 调用Bison-Invoking Bison
Bison分析器(Bison parser) 1.7 Bison的输出:分析器文件-Bison Output: the Parser File
Bison分析器算法(Bison parser algorithm) 5. Bison分析器算法-The Bison Parser Algorithm
Bison符号(Bison symbols), 表格(table of) A. Bison符号-Bison Symbols
Bison工具(Bison utility) 1.7 Bison的输出:分析器文件-Bison Output: the Parser File
Bison声明(Bison declarations) 3.7 Bison声明-Bison Declarations
Bison声明(简介)(Bison declarations (introduction)) 3.1.2 Bison Declarations部分-The Bison Declarations Section
Bison声明总结(Bison declaration summary) 3.7.10 Bison声明总结-Bison Declaration Summary
Bison语法(Bison grammar) 1.2 从正规文法转换到Bison的输入-From Formal Rules to Bison Input
Bison语法文件的布局(layout of Bison grammar) 1.9 Bison语法文件的整体布局-The Overall Layout of a Bison Grammar
Bison中的符号(symbols in Bison), 表格(table of) A. Bison符号-Bison Symbols
BNF 1.1 语言与上下文无关文法-Languages and Context-Free Grammars

--------------------------------------------------------------------------------

C
calc 2.2 中缀符号计算器:calc-Infix Notation Calculator: calc
conflicts 1.5.2 使用GLR解决歧义-Using GLR to Resolve Ambiguities
C代码(C code), 额外部分(section for additional) 3.1.4 Epilogue部分-The epilogue

--------------------------------------------------------------------------------

E
else, 悬挂(dangling) 5.2 移进/归约冲突-Shift/Reduce Conflicts
epilogue 3.1.4 Epilogue部分-The epilogue

--------------------------------------------------------------------------------

F
FDL, GNU Free Documentation License C.1 GNU Free Documentation License

--------------------------------------------------------------------------------

G
generalized LR (GLR) parsing, ambiguous grammars 1.5.2 使用GLR解决歧义-Using GLR to Resolve Ambiguities
GLR parsing, ambiguous grammars 1.5.2 使用GLR解决歧义-Using GLR to Resolve Ambiguities
GLR 分析(GLR parsing) 1.1 语言与上下文无关文法-Languages and Context-Free Grammars
GLR分析(GLR parsing) 1.5 编写GLR分析器-Writing GLR Parsers
GLR分析(GLR parsing) 5.8 通用LR (GLR)分析-Generalized LR (GLR) Parsing
GLR分析(GLR parsing), 非歧义文法(unambiguous grammars) 1.5.1 使用GLR分析器分析非歧义文法
GLR分析器和inline(GLR parsers and inline) 1.5.3 编译GLR分析器时需要考虑的问题-Considerations when Compiling GLR Parsers

--------------------------------------------------------------------------------

I
inline 1.5.3 编译GLR分析器时需要考虑的问题-Considerations when Compiling GLR Parsers

--------------------------------------------------------------------------------

L
LALR(1) 5.7 神秘的归约/归约冲突-Mysterious Reduce/Reduce Conflicts
LALR(1) 文法(LALR(1) grammars) 1.1 语言与上下文无关文法-Languages and Context-Free Grammars
LR(1) 5.7 神秘的归约/归约冲突-Mysterious Reduce/Reduce Conflicts
LR(1) 文法(LR(1) grammars) 1.1 语言与上下文无关文法-Languages and Context-Free Grammars
ltcalc 2.4 带有位置追踪的计算器:ltcalc-Location Tracking Calculator: ltcalc

--------------------------------------------------------------------------------

M
mfcalc 2.5 多功能计算器:mfcalc-Multi-Function Calculator: mfcalc

--------------------------------------------------------------------------------

P
Prologue 3.1.1 Prologue部分-The prologue

--------------------------------------------------------------------------------

R
reduce/reduce conflicts 1.5.2 使用GLR解决歧义-Using GLR to Resolve Ambiguities
rpcalc 2.1 逆波兰记号计算器-Reverse Polish Notation Calculator

--------------------------------------------------------------------------------

跳转到: � � � � � � � � � � � � � � � � � � � � � � � � � � � � �
A B C E F G I L M P R

--------------------------------------------------------------------------------
[顶层] [内容] [索引] [ ? ]

目录
Bison简介-Introduction
使用Bison的条件-Conditions for Using Bison
GNU GENERAL PUBLIC LICENSE
Preamble
Appendix: How to Apply These Terms to Your New Programs
1. 和Bison相关的一些基本概念-The Concepts of Bison
1.1 语言与上下文无关文法-Languages and Context-Free Grammars
1.2 从正规文法转换到Bison的输入-From Formal Rules to Bison Input
1.3 语义值-Semantic Values
1.4 语义动作
1.5 编写GLR分析器-Writing GLR Parsers
1.5.1 使用GLR分析器分析非歧义文法
1.5.2 使用GLR解决歧义-Using GLR to Resolve Ambiguities
1.5.3 编译GLR分析器时需要考虑的问题-Considerations when Compiling GLR Parsers
1.6 位置-Locations
1.7 Bison的输出:分析器文件-Bison Output: the Parser File
1.8 使用Bison的流程-Stages in Using Bison
1.9 Bison语法文件的整体布局-The Overall Layout of a Bison Grammar
2. 实例-Examples
2.1 逆波兰记号计算器-Reverse Polish Notation Calculator
2.1.1 rpclac的声明部分-Declarations for rpcalc
2.1.2 rpcalc的语法规则-Grammar Rules for rpcalc
2.1.2.1 解释input-Explanation of input
2.1.2.2 解释line-Explanation of line
2.1.2.3 解释expr-Explanation of expr
2.1.3 rpcalc的词法分析器-The rpcalc Lexical Analyzer
2.1.4 控制函数-The Controlling Function
2.1.5 错误报告的规则-The Error Reporting Routine
2.1.6 运行Bison来产生分析器-Running Bison to Make the Parser
2.1.7 编译分析器文件-Compiling the Parser File
2.2 中缀符号计算器:calc-Infix Notation Calculator: calc
2.3 简单的错误恢复-Simple Error Recovery
2.4 带有位置追踪的计算器:ltcalc-Location Tracking Calculator: ltcalc
2.4.1 ltcalc的Declarations-Declarations for ltcalc
2.4.2 ltcalc的语法规则-Grammar Rules for ltcalc
2.4.3 ltcalc的词法分析器-The ltcalc Lexical Analyzer.
2.5 多功能计算器:mfcalc-Multi-Function Calculator: mfcalc
2.5.1 mfcalc的声明-Declarations for mfcalc
2.5.2 mfcalc的语法规则-Grammar Rules for mfcalc
2.5.3 mfcalc的符号表-The mfcalc Symbol Table
2.6 练习-Exercises
3. Biosn的语法文件-Bison Grammar Files
3.1 Bison语法的提纲-Outline of a Bison Grammar
3.1.1 Prologue部分-The prologue
3.1.2 Bison Declarations部分-The Bison Declarations Section
3.1.3 语法规则部分-The Grammar Rules Section
3.1.4 Epilogue部分-The epilogue
3.2 符号,终结符和非终结符-Symbols, Terminal and Nonterminal
3.3 描述语法规则的语法-Syntax of Grammar Rules
3.4 递归规则-Recursive Rules
3.5 定义语言的语义-Defining Language Semantics
3.5.1 语义值的数据类型-Data Types of Semantic Values
3.5.2 多种值类型-More Than One Value Type
3.5.3 动作-Actions
3.5.4 动作中值的数据类型-Data Types of Values in Actions
3.5.5 规则中的动作-Actions in Mid-Rule
3.6 追踪位置-Tracking Locations
3.6.1 位置的数据类型-Data Type of Locations
3.6.2 动作和位置-Actions and Locations
3.6.3 位置的默认动作-Default Action for Locations
3.7 Bison声明-Bison Declarations
3.7.1 符号类型名称-Token Type Names
3.7.2 操作符优先级-Operator Precedence
3.7.3 值类型集-The Collection of Value Types
3.7.4 非终结符-Nonterminal Symbols
3.7.5 在分析执行前执行一些动作-Performing Actions before Parsing
3.7.6 释放被丢弃的符号-Freeing Discarded Symbols
3.7.7 消除冲突警告-Suppressing Conflict Warnings
3.7.8 开始符号-The Start-Symbol
3.7.9 纯(可重入)分析器-A Pure (Reentrant) Parser
3.7.10 Bison声明总结-Bison Declaration Summary
3.8 在同一个程序中使用多个分析器-Multiple Parsers in the Same Program
4. 分析器C语言接口-Parser C-Language Interface
4.1 分析器函数yyparse-The Parser Function yyparse
4.2 词法分析器函数yylex-The Lexical Analyzer Function yylex
4.2.1 yylex的调用惯例-Calling Convention for yylex
4.2.2 记号的语义值-Semantic Values of Tokens
4.2.3 记号的文字位置-Textual Locations of Tokens
4.2.4 纯分析器的调用惯例-Conventions for Pure Parsers
4.3 错误报告函数yyerror-The Error Reporting Function yyerror
4.4 在动作中使用的特殊特征-Special Features for Use in Actions
5. Bison分析器算法-The Bison Parser Algorithm
5.1 超前扫描记号-Look-Ahead Tokens
5.2 移进/归约冲突-Shift/Reduce Conflicts
5.3 操作符优先级-Operator Precedence
5.3.1 什么时候需要优先级-When Precedence is Needed
5.3.2 指定操作符的优先级-Specifying Operator Precedence
5.3.3 优先级使用的例子-Precedence Examples
5.3.4 优先级如何工作-How Precedence Works
5.4 上下文依赖优先级-Context-Dependent Precedence
5.5 分析器状态-Parser States
5.6 归约/归约冲突-Reduce/Reduce Conflicts
5.7 神秘的归约/归约冲突-Mysterious Reduce/Reduce Conflicts
5.8 通用LR (GLR)分析-Generalized LR (GLR) Parsing
5.9 栈溢出以及如何避免它-Stack Overflow, and How to Avoid It
6. 错误恢复-Error Recovery
7. 处理上下文依赖-Handling Context Dependencies
7.1 符号类型中的语义信息-Semantic Info in Token Types
7.2 词法关联-Lexical Tie-ins
7.3 词法关联和错误恢复-Lexical Tie-ins and Error Recovery
8. 调式你的分析器-Debugging Your Parser
8.1 理解你的分析器-Understanding Your Parser
8.2 跟踪你的分析器-Tracing Your Parser
9. 调用Bison-Invoking Bison
9.1 Bison选项-Bison Options
9.2 选项交叉键-Option Cross Key
9.3 Yacc库-Yacc Library
10. 常见问题-Frequently Asked Questions
10.1 分析器栈溢出-Parser Stack Overflow
10.2 我如何复位分析器-How Can I Reset the Parser
10.3 被销毁的字符串-Strings are Destroyed
10.4 C++分析器-C++ Parsers
10.5 实现跳转/循环-Implementing Gotos/Loops
A. Bison符号-Bison Symbols
B. 词汇表-Glossary
C. 复制这个手册-Copying This Manual
C.1 GNU Free Documentation License
C.1.1 ADDENDUM: How to use this License for your documents
索引-Index

--------------------------------------------------------------------------------
[顶层] [内容] [索引] [ ? ]

关于这个文档
这个文档由Charlie &在2005,六月,21使用王箫改进的texi2html 1.76生成.

导航面板的按钮有如下意义

按钮 名称 转到 From 1.2.3 go to
[ < ] Back 阅读顺序的上一章 1.2.2
[ > ] Forward 阅读顺序的下一章 1.2.4
[ << ] FastBack 章节的开始或上一章 1
[ 上层 ] Up 上层章节 1.2
[ >> ] FastForward 下一章 2
[顶层] Top 文档封面
[内容] Contents 目录
[索引] Index 索引
[ ? ] About 关于 (帮助)

这个 例子 假定当前的位置是在如下结构文档的 章节 1-2-3

1. 第一部分
1.1 章节 1-1
...
1.2 章节 1-2
1.2.1 章节 1-2-1
1.2.2 章节 1-2-2
1.2.3 章节 1-2-3 <== 当前位置
1.2.4 章节 1-2-4
1.3 章节 1-3
...
1.4 章节 1-4

--------------------------------------------------------------------------------

这个文档由Charlie &在2005,六月,21使用王箫改进的texi2html 1.76生成.

本文来自博客：