If you have any problem please contact with me. I will provide you the following services THEORY OF COMPUTATION Deterministic finite automata (DFA) Regular language nonregular language CFG Nondeterministic finite automata (NFA) From DFA to NFA From NFA to DFA TG Regular expressions (RE) From RE to NFA From NFA to RE roving non-regularity using the Pumping Lemma Proving non-regularity using reduction on text-free grammars and languages Context-free languages subsume regular languages Self-reference and incompleteness Turning machine Decidable and undecidable problems pumping lemma COMPILER CONSTRUCTION phases of compiler Lexical analysis Syntex analysis Top-Down-parsing(and its types) Bottom -up-parsing(and types) intermediate code Derivation code optimization parsing code generation symbol table please contact me before placing an order