Description: Choose a variety of common high-level programming languages are more common grammatical structure unsigned arithmetic as the analysis object, given its grammatical description (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 description of the necessary information.
To Search:
File list (Check if you may need any files):
编译原理实验二程序.txt
Download