4 ms·
I'd like to see something like this for practitioners. I kind of have a feel for what's out there, but I don't know of anything that is: 1. pleasant to use 2. s
by davidkellis 6y ago
I'd like to see something like this for practitioners. I kind of have a feel for what's out there, but I don't know of anything that is:
1. pleasant to use
2. simple
3. scannerless
4. supports left recursion that produces a left-associative parse
- bmn__ 6y agoMarpa meets 2.a) 2.b) 3. 1. is subjective.
- DmitrySoshnikov 6y agoYes, we use LALR(1) parsing mode to build the actual parser, and it exactly supports Left recursive grammars (which are much more elegant than LL). We also don't focus much on scanner (tokenizer) since this is a topic of Regular expressions and Finite automata which we discuss in detail in the separate class "Building a RegExp machine".
- norswap 6y agoShameless self-promotion: https://github.com/norswap/autumn https://github.com/norswap/autumn