Skip to content

Files

Latest commit

 

History

History
20 lines (14 loc) · 986 Bytes

linear-time-parser-combinators.md

File metadata and controls

20 lines (14 loc) · 986 Bytes

Linear-time parser combinators

Notes

@brendanzab:

This blog post seems to be based on their prior papers12, but drops the lexer. I had a tried replicating it in the lang-ll1-combinators project.

The way they use bit sets to detect ambiguities reminds me a great deal of the approach we are using in doodle, but limited to one character of lookahead.

Footnotes

  1. A typed, algebraic approach to parsing

  2. flap: A Deterministic Parser with Fused Lexing