Description: Input has to eliminate left recursion and extract the public left factor of LL (1) grammar, then input the corresponding expression, if the analysis is successful, the output in the process of recursive output "acc", if you don t succeed, have the corresponding error and position name. Note that will divide the same non-terminal production into a single input. It will automatically calculate first, follow, forecast analysis of table structure, but not the output.
To Search:
File list (Check if you may need any files):
LL1\LL1\1.TXT
...\...\2.TXT
...\...\3.TXT
...\...\4.TXT
...\...\5.txt
...\...\Debug\Grammar.obj
...\...\.....\Grammar.sbr
...\...\.....\GrammerAnalyzeDlg.obj
...\...\.....\GrammerAnalyzeDlg.sbr
...\...\.....\LL1.exe
...\...\.....\LL1.ilk
...\...\.....\LL1.obj
...\...\.....\LL1.pch
...\...\.....\LL1.pdb
...\...\.....\LL1.res
...\...\.....\LL1.sbr
...\...\.....\LL1Dlg.obj
...\...\.....\LL1Dlg.sbr
...\...\.....\Percept.obj
...\...\.....\Percept.sbr
...\...\.....\Set.obj
...\...\.....\Set.sbr
...\...\.....\StdAfx.obj
...\...\.....\StdAfx.sbr
...\...\.....\TreeDlg.obj
...\...\.....\TreeDlg.sbr
...\...\.....\vc60.idb
...\...\.....\vc60.pdb
...\...\.....\webbrowser2.obj
...\...\.....\webbrowser2.sbr
...\...\Grammar.cpp
...\...\Grammar.h
...\...\GrammerAnalyzeDlg.cpp
...\...\GrammerAnalyzeDlg.h
...\...\LL1.APS
...\...\LL1.clw
...\...\LL1.cpp
...\...\LL1.dsp
...\...\LL1.dsw
...\...\LL1.h
...\...\LL1.ncb
...\...\LL1.opt
...\...\LL1.plg
...\...\LL1.rc
...\...\LL1Dlg.cpp
...\...\LL1Dlg.h
...\...\Percept.cpp
...\...\Percept.h
...\...\ReadMe.txt
...\...\res\LL1.ico
...\...\...\LL1.rc2
...\...\Resource.h
...\...\Set.cpp
...\...\Set.h
...\...\StdAfx.cpp
...\...\StdAfx.h
...\...\TreeDlg.cpp
...\...\TreeDlg.h
...\...\webbrowser2.cpp
...\...\webbrowser2.h
...\...\~VCF81.tmp
...\...\~VCF82.tmp
...\...\Debug
...\...\res
...\LL1
LL1
Download