Generate lexers for programs in various languages from the DFA #32
Conversation
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
The MVP is mostly just for demo purposes of showing how to generate a python state machine for lexing from a DFA. Signed-off-by: Tim Henderson <tim.tadh@gmail.com>
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
Add this suggestion to a batch that can be applied as a single commit.
This suggestion is invalid because no changes were made to the code.
Suggestions cannot be applied while the pull request is closed.
Suggestions cannot be applied while viewing a subset of changes.
Only one suggestion per line can be applied in a batch.
Add this suggestion to a batch that can be applied as a single commit.
Applying suggestions on deleted lines is not supported.
You must change the existing code in this line in order to create a valid suggestion.
Outdated suggestions cannot be applied.
This suggestion has been applied or marked resolved.
Suggestions cannot be applied from pending reviews.
Suggestions cannot be applied on multi-line comments.
Suggestions cannot be applied while the pull request is queued to merge.
Suggestion cannot be applied right now. Please check back later.
This is an experimental PR which contains support for generating lexers for programming languages directly from a DFA specification. It does not use the same API as the rest of lexmachine.
For a first proof of concept I wrote a super simple generator for Python. The code it produces is probably not optimal for python.
This branch may or may not every be merged. Chime in if you have a good use case or language you want support for (including Go).