On Wed, Jan 16, 2019 at 09:31:13PM +0100, Zelphir Kaltstahl wrote: > Perhaps I should put a link into the source code whenever I follow a > tutorial. Sorry for the confusion!
[...] > I am still unsure about the theoretical CS stuff: What kind of parsers > one can possibly write with parser combinators? Which language class is > that? I have language X can I parse it completely using parser > combinators? etc. Theoretical CS and the proofs were not my strongest area. AFAIK they implement recursive descent parsers [1], i.e. they are good for LL languages (LL(k) if there is a way to "peek ahead"). Thus they aren't as powerful as table based parsers -- but easier to grok. Cheers [1] https://en.wikipedia.org/wiki/Recursive_descent_parsers -- t
signature.asc
Description: Digital signature
