I need someone designed a compiler before or has a good experience building compilers component like DFA ,NFA ,lexical analyzer and has good handling on Regular definitions and expressions
I need a simple program to create a DFA generator (Deterministic Finite Automate) that takes
input an action-augmented regular definitions(or Regular expressions) and produce the corresponding fall-back DFA with actions.
for example :
RS: LS: Action :
term ---> id |a? A(term)= Print(<term, lex>);
exp --> id_id_! | id ! A(exp) = print(<exp, prefix(lex, length(lex) - 1>)
quest --> id ? A(quest) = print(<quest; prefix(lex; length(lex) -1>)
letter -----> [A-Za-z]
digit -----> [0-9]
id -------> letter(letter|digit)*
where RS ,LS ,Action will be the input of the DFA generator .
I need this done in 48- 72 hours at most with C# language .
I need it to be done with functions ,meaning not too much classes
5 freelancers estão ofertando em média $72 para este trabalho
I have a similar compiler project but in Java. I have developed it long before. Feel free to contact me, So that i can provide you the code, if you have no problem it in Java.