Hacker News new | ask | show | jobs
by mbrock 3720 days ago
Does this kind of PEG parser deal somewhat decently with partial or incorrect syntax trees?
1 comments

The parser will match the specified grammar exactly, like it should. You could of course specify a grammar that is broader than the actual language you are parsing.
Well, I am vaguely aware of the existence of "incremental parsers" and "tolerant parsers", and a code editor necessarily works on code that's only partially correct...