> Text parsing for programming languages is NOT a difficult problem
And of course that's why the world is littered with a million 100%-functional C++ parsers, right?
And of course that's why the world is littered with a million 100%-functional C++ parsers, right?
Writing a recursive descent parser is actually quite intuitive. It's the solution that you'd eventually arrive at if given the problem of parsing some specific context free language.
GLR, GLL and PwD are solutions to parsing non-cfg (i.e. grammars that have more than one parse-tree) in optimal time.
¹ http://stackoverflow.com/questions/14589346/is-c-context-fre...