文件名称:yufa
介绍说明－－下载内容均来自于网络，请自行研究使用
选择对各种常见高级程序设计语言都较为通用的语法结构无符号数的算术四则运算作为分析对象，给出其文法描述（注意应与所采用的语法分析方法比较贴近），设计并实现一个完整的语法分析程序。
输入：由实验一输出的单词类别串，如1，3，1。
输出：对于所输入的源程序，如果输入符号串是给定文法定义的合法句子，则输出“RIGHT”，并且给出每一步归约的过程；如果不是句子，即输入串有错误，则输出“ERROR”，并且显示已经归约出的各个文法符号，以及必要的出错说明信息。
-Choose a variety of common high-level programming languages are more common grammatical structure unsigned arithmetic arithmetic as the analysis object, given its grammatical descr iption (Note that the syntax should be used with the analysis method is close to), to design and implement a complete the parser.
Input: the output from the experimental one category string of words, such as 1,3,1.
Output: For the input source, if the input symbol string is the legal definition of a given sentence grammar, then output "RIGHT", and gives every step of the reduction process if not a sentence, that is, the input string for errors, then the output "ERROR", and the show has been a reduction in all grammar symbols, and the error descr iption of the necessary information.
输入：由实验一输出的单词类别串，如1，3，1。
输出：对于所输入的源程序，如果输入符号串是给定文法定义的合法句子，则输出“RIGHT”，并且给出每一步归约的过程；如果不是句子，即输入串有错误，则输出“ERROR”，并且显示已经归约出的各个文法符号，以及必要的出错说明信息。
-Choose a variety of common high-level programming languages are more common grammatical structure unsigned arithmetic arithmetic as the analysis object, given its grammatical descr iption (Note that the syntax should be used with the analysis method is close to), to design and implement a complete the parser.
Input: the output from the experimental one category string of words, such as 1,3,1.
Output: For the input source, if the input symbol string is the legal definition of a given sentence grammar, then output "RIGHT", and gives every step of the reduction process if not a sentence, that is, the input string for errors, then the output "ERROR", and the show has been a reduction in all grammar symbols, and the error descr iption of the necessary information.
(系统自动生成,下载前可以参看下载内容)
下载文件列表
编译原理实验二程序.txt