Pliant
Pliant copied to clipboard
patrickhuber
Creation of concrete classes from the grammar is currently a manual process. Create a set of t4 templates that generate classes for a given grammar.
I need extensions to specify unicode character by it's code (just "\\\?" is not enough for me) I mean paragraph §4.19 in ISO 14977 ( https://www.cl.cam.ac.uk/~mgk25/iso-14977.pdf ) _special-sequence-symbol_ rule and...
2004, Greg Sandstrom, A Parallel Extension of Earley’s Parsing Algorithm 2009, MIT, Parallelizing the CKY and Earley Parsing Algorithms "many general-purpose 16 processor machines exist and the number of processors...
Here is the grammar which I want to use: a_file := v_file | o_file ; o_file := file - v_file ; v_file := { a_directive } ; file := {...
Given that the parse forest is a binary tree, a dictionary can be passed into a disambiguation algorithm that tells each node which child to traverse. The disambiguation algorithm is...
System.IO.Pipelines handles buffer management for the consumer. This may have performance benefits over reading one byte at a time from the underlying stream.
this implementation claimed to be fastest: https://github.com/vnmakarov/yaep it's readme file contain performance comparison with Marpa and yacc
2006, Sheng-Jun Wang, Cheng-Zhi Jin, An extension of earley's algorithm for extended grammars https://link.springer.com/chapter/10.1007/978-1-4020-3953-9_22 EUR 24.95 (It's text is also visible through google books preview) I don't know do you...
It would be good to parse grammars of other parsers as is (using their grammars). GOLD parser in particular. _AntlrCS_ and _gppg_ are 2 other tools.
A simple grammar like E -> E + E E -> E \* E The \* should have a higher precedence (appear farther to the left) in the parse forest...