GitHub - ye7ia10/Compiler_Generator: The lexical analyzer generator is automatically construct a lexical analyzer from a regular expression description of a set of tokens. The tool is required to construct a nondeterministic finite automata (NFA) for the given regular expressions, combine these NFAs together with a new starting state, convert the resulting NFA to a DFA, minimize it and emit the transition table for the reduced DFA together with a lexical analyzer program that simulates the resulting DFA machine.

Branches Tags

Name		Name	Last commit message	Last commit date
Latest commit History 44 Commits
bin/Debug		bin/Debug
lexical		lexical
obj/Debug		obj/Debug
parser		parser
phase3		phase3
tests		tests
CompilerProjectReport.pdf		CompilerProjectReport.pdf
Compilerss.cbp		Compilerss.cbp
Compilerss.depend		Compilerss.depend
Compilerss.layout		Compilerss.layout
ParsingProcess.txt		ParsingProcess.txt
PredictiveTable.txt		PredictiveTable.txt
ReportPhaseOne&Two.pdf		ReportPhaseOne&Two.pdf
ReportPhaseOne.pdf		ReportPhaseOne.pdf
ReportPhaseTwo.pdf		ReportPhaseTwo.pdf
input.txt		input.txt
main.cpp		main.cpp
output.txt		output.txt
parser.txt		parser.txt
test.txt		test.txt
testCases_Parser.txt		testCases_Parser.txt

About

The lexical analyzer generator is automatically construct a lexical analyzer from a regular expression description of a set of tokens. The tool is required to construct a nondeterministic finite automata (NFA) for the given regular expressions, combine these NFAs together with a new starting state, convert the resulting NFA to a DFA, minimize it…