News for hackers. Stuff that matters.
Re:On the Complexity and Performance of Parsing with Derivat... by wfunction on Saturday June 25, 2016 @07:34PM (#11978593)
> 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?

Re:On the Complexity and Performance of Parsing with Derivat... by thwd on Saturday June 25, 2016 @09:20PM (#11978952)
C++ is a bad example because its' grammar is not actually context free.

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.

Re:On the Complexity and Performance of Parsing with Derivat... by PeCaN on Saturday June 25, 2016 @08:37PM (#11978827)
Given that parsing C++ may be Turing complete¹ I'm not exactly sure that's the best example to use. The world _is_ littered with a million JavaScript and Python parsers.

¹ http://stackoverflow.com/questions/14589346/is-c-context-fre...

Re:On the Complexity and Performance of Parsing with Derivat... by jackmott on Monday June 27, 2016 @04:59PM (#11989435)
It kind of is yeah. A new language is posted on reddit every day.