文件名称:main
介绍说明－－下载内容均来自于网络，请自行研究使用
A bottom-up parse corresponds to the construction of a parse tree for an input string beginning at the leaves (the bottom) and working up towards the root (the top) . It is convenient to describe parsing as the process of building parse trees, although a front end may in fact carry out a translation directly without building an explicit tree.
We can think of bottom-up parsing as the process of reducing a string w to the start symbol of the grammar. At each reduction step, a specific substring matching the body of a production is replaced by the non terminal at the head of that production. The key decisions during bottom-up parsing are about when to reduce and about what production to apply, as the parse proceeds.
-A bottom-up parse corresponds to the construction of a parse tree for an input string beginning at the leaves (the bottom) and working up towards the root (the top) . It is convenient to describe parsing as the process of building parse trees, although a front end may in fact carry out a translation directly without building an explicit tree.
We can think of bottom-up parsing as the process of reducing a string w to the start symbol of the grammar. At each reduction step, a specific substring matching the body of a production is replaced by the non terminal at the head of that production. The key decisions during bottom-up parsing are about when to reduce and about what production to apply, as the parse proceeds.
We can think of bottom-up parsing as the process of reducing a string w to the start symbol of the grammar. At each reduction step, a specific substring matching the body of a production is replaced by the non terminal at the head of that production. The key decisions during bottom-up parsing are about when to reduce and about what production to apply, as the parse proceeds.
-A bottom-up parse corresponds to the construction of a parse tree for an input string beginning at the leaves (the bottom) and working up towards the root (the top) . It is convenient to describe parsing as the process of building parse trees, although a front end may in fact carry out a translation directly without building an explicit tree.
We can think of bottom-up parsing as the process of reducing a string w to the start symbol of the grammar. At each reduction step, a specific substring matching the body of a production is replaced by the non terminal at the head of that production. The key decisions during bottom-up parsing are about when to reduce and about what production to apply, as the parse proceeds.
(系统自动生成,下载前可以参看下载内容)
下载文件列表
main.c