4 ms·
Which is funny because a recursive descent parser is actually very simple.
by ohyes 10y ago
Which is funny because a recursive descent parser is actually very simple.
- userbinator 10y agoI agree completely, but it seems a lot of others (unfortunately) don't, as this rather saddening link shows: http://stackoverflow.com/questions/28256/equation-expression-parser-with-precedence http://stackoverflow.com/questions/28256/equation-expression...
- joe_the_user 10y agoYes, the thing about the inability of a given programmer to produce a recursive descent parser is that it generally comes from an actual ignorance of a what an abstract language is rather than from a particular technical inability. Especially, coming from naive object orientation, a language seems like it should just be a thing, an "object" and so you should be able to define a "language object" and go from there. But actually an abstract language operates on a "whole other level" than the usual hierarchy of members and methods described in simple object-oriented design. Anyway, hopefully the derivative idea is to have constructs kind-of like regular expressions but actually reflecting language-structure and able to general good and understandable parsers.