While working on my course design in principle of compiler class,I found a paradox that is when I am trying to get a DFA-generator based on RE-parse,I have to make a syntax-translator,but a syntax-translator cannot be achieved because of no DFA to recognize its elements.But now,I get a good thought to avoid this kind of confusing things,that is,build the DFA by funtion-parse not RE-parse,so we don't need a syntax-translator.So there is a prototype for showing my idea that contains some issues not fixed.
-
Notifications
You must be signed in to change notification settings - Fork 1
JOKER-404/iLEX
About
a DFA generator based on funtion-calls not RE-parse
Resources
Stars
Watchers
Forks
Releases
No releases published
Packages 0
No packages published