Description: (1) According to the LL (1) method to write a parser, according to their own situation, choose one of the following analysis of the algorithm as input:
a. directly into the basis of known structures of grammar table M
b. enter the grammar of FIRST (α) and FOLLOW (U) set automatically by the program analysis table statute of Health M
c. Enter known grammar, the program can automatically construct grammatical analysis table M.
(2) program has universal
The developed program used in various types of grammar and an arbitrary input string, and can determine whether the grammar LL (1) grammar.
(3) the running instance
Grammar and symbols for the input string, the parser should be compiled correctly determine whether this string of sentence grammar, and asked the output of the process.
To Search:
File list (Check if you may need any files):
编译原理课程设计原稿（陈强 20029440913）\编译原理课程设计（语法分析程序）陈强.doc
........................................\陈强 20029440913\Debug\vc60.idb
........................................\................\.....\vc60.pdb
........................................\................\.....\yufafenxi.exe
........................................\................\.....\yufafenxi.ilk
........................................\................\.....\yufafenxi.obj
........................................\................\.....\yufafenxi.pch
........................................\................\.....\yufafenxi.pdb
........................................\................\yufafenxi.cpp
........................................\................\yufafenxi.dsp
........................................\................\yufafenxi.dsw
........................................\................\yufafenxi.ncb
........................................\................\yufafenxi.opt
........................................\................\yufafenxi.plg
........................................\................\Debug
........................................\陈强 20029440913
编译原理课程设计原稿（陈强 20029440913）
Download