First version of a Turtle Parser (cleaned) #152
Merged
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
- Uses recursive descent parsing (LL1-Grammar) - Currently Lexing is done manually using google's re2 regexes. - Sometimes lexing is done with custom c++-code when faster (e.g. for whitespace) - Probably better to write a proper Lexer using longest match or use Lexer generator - Bzip2 Decompression still has some flaws. - passing a *.ttl file with the -n argument of IndexBuilderMain will use the turtle parser
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.
Niklas: This is a
git rebase --interactive mastercleaned version of @joka921's code. I think the test failure in the orginal PR #140 is actually a result of hismasterbranch not beinggit submodule sync && git submodule update --init --recursivesynced.Uses recursive descent parsing (LL1-Grammar)
Currently Lexing is done manually using google's re2 regexes.
Sometimes lexing is done with custom c++-code when faster (e.g. for
whitespace)
Probably better to write a proper Lexer using longest match or use
Lexer generator
Bzip2 Decompression still has some flaws.
passing a *.ttl file with the -n argument of IndexBuilderMain will use the turtle parser