Description: For the establishment of a LL (1) grammar compiler automatic generator. To accomplish this compiler generator must deal with the source file twice: first pass lexical analysis, parsing the second time. Parser using LL (1) syntax analysis. First, write the input file defined grammar (grammar can be used in LL (1) analysis), and then create the lexical analyzer, including lexical analysis of the main program, scanner parts, keyword lists. The lexical analysis of the inputs were calculated for each non-terminal grammar symbol of the FIRST set of each non-terminal symbol FOLLOW set, and each set of the rule s SELECT and determine any non-terminal symbol of any two rules SELECT set intersection is not all empty, if it is in line with the input grammar LL (1) the text rule can be analyzed.
To Search:
File list (Check if you may need any files):
settings.pl
rules_shift_jis.csv
regexps.pl
excellabels.csv
excel.pl
checkVers.pl
beastDecode.pl
beastB.pl
beast.pl
Download