-
`PostgresUtils::toPGObjectOrArray` contains a canonical parser that uses a state machine to parse one recursive step at a time. This may have been a good choice for simple object or array notations. B…
-
See https://github.com/djspiewak/scala-bison, its [tool paper](https://www.sciencedirect.com/science/article/pii/S1571066110001118) and [the original paper on recursive ascent/descent](https://link.sp…
-
I'm following the recursive decent parser definition from here: https://gpuweb.github.io/gpuweb/wgsl/#recursive-descent-syntax-expression
But I think there may be a mistake: The `expression` can neve…
-
-
Arithmetic (should be easy with jdecimal and a golfed recursive descent parser). Should persist on tab out etc (you can see the result with auto fill anyway).
If you load an existing transaction an…
-
-
I was trying to run some basic grammar that had some left recursion and realized that the parser doesn't seem to support that. Is there a reason for that/would it be possible for the parser to support…
-
Currently, the parsing of inline content happens during rendering. This limits the information you have in the document after parsing. Instead, Asciidoctor should parse all text extents into inline no…
-
This might involve making the parser work as a recursive descent parser, and definitely requires making the program stable under attempting to derefence `Vector.end()`
-
Parser combinator libraries, like our very own `miniparsec`, are often vulnerable to left-recursion:
> **Expressions with left recursion cannot be encoded by recursive descent parsers and will dive…