Description: An arbitrary input to a grammar G
2, handle left recursive grammar and public left factor
3, for each nonterminal in the grammar automatically generate and print the output:
① the FIRST set
② FOLLOW sets
4, the judge after the grammar is LL (1) grammar, if yes, to automatically generate and print the output of the prediction table
5, the simulation analysis.
Enter a sentence if the sentence is legitimate output corresponding with the sentence syntax tree able to output analysis process every step of the symbols in the stack changes. If the sentence is illegal is the appropriate error handling.
To Search:
File list (Check if you may need any files):
语法分析器\grammer.txt
..........\input.txt
..........\output.txt
..........\yf.cpp
..........\语法分析器.dsp
..........\语法分析器.dsw
..........\语法分析器.ncb
..........\语法分析器.plg
..........\Debug\vc60.idb
..........\.....\vc60.pdb
..........\.....\yf.sbr
..........\.....\语法分析器.bsc
..........\.....\语法分析器.exe
..........\.....\语法分析器.ilk
..........\.....\语法分析器.pch
..........\.....\语法分析器.pdb
..........\.....\yf.pch
..........\.....\yf.obj
..........\.....\yf.ilk
..........\.....\yf.exe
..........\.....\yf.pdb
..........\语法分析器.opt
..........\yf.dsp
..........\yf.ncb
..........\yf.plg
..........\yf.opt
..........\yf.dsw
..........\Debug
语法分析器
语法分析器实验报告.doc