cadey
/
nim-wiki
1
0
Fork 0
Code Issues Pull Requests Releases Wiki Activity

Updated GSoC 2014 Ideas (markdown)

This commit is contained in:
Andreas Rumpf 2014-02-13 04:33:17 -08:00
parent 5278db6c47
commit c878524031
1 changed files with 7 additions and 0 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

7
GSoC-2014-Ideas.md
View File

@ -265,6 +265,13 @@ ___
* Model it after re2c or the Ragel state machine generator * Model it after re2c or the Ragel state machine generator
* Alternatively model it after Flex. * Alternatively model it after Flex.
Here is a sketch of a possible implementation:
* Parse regular expressions into an NFA and ensure the attached Nimrod actions are kept around through the next different passes.
* Translate the NFA to an DFA: http://web.cecs.pdx.edu/~harry/compilers/slides/LexicalPart3.pdf
* Minimize the DFA with Hopcroft's algorithm: http://en.wikipedia.org/wiki/DFA_minimization
* Translate the DFA into Nimrod code and attach the actions.
**Desirable skills**: Knowledge of lexer generators. How to translate regexes into DFAs and how to optimize the resulting automatons. **Desirable skills**: Knowledge of lexer generators. How to translate regexes into DFAs and how to optimize the resulting automatons.