gll
gll copied to clipboard
rust-lang
GLL parsing framework.
This is a testcase that demonstrates the problem (in `tests/basic.rs`): ```rust multiple { A = X:"x" | Y:"x"; }: A("x") => "\ 1:1-1:2 => A::X( 1:1-1:2, )"; ``` The output...
@eternaleye suggested that instead of having only "validators", that remove "invalid" choices from the SPPF, a more general approach involves `PartialOrd`, or more specifically, a function taking two `Handle` and...
If the built-in proc-macro `IDENT` rule is computed *after* regular rules are added, it could depend on a user-defined rule, let's say `KEYWORD`, such that: ```rust KEYWORD = "be" |...
At least it should be one of the provided options, alongside separate code generation. A *huge* benefit is being able to use `Span`s from the grammar syntax, *inside* the generated...
@eternaleye brought it up and I'm not sure exactly how you might be able to simplify codegen when the scheduling strategy is always depth-first (perhaps it's a space-time tradeoff?).
No where on the project landing page (https://github.com/rust-lang/gll/) it says what "gll" is or means. Could we have a succinct explanation in the readme or project description?
> eddyb 2019-04-18 at 11:56 AM EDT > I need to optimize the iterators so they don't actually use `BTreeSet` iterators > eddyb 2019-04-18 at 11:57 AM EDT > right...
