Y
Hacker News
new
|
ask
|
show
|
jobs
by
girvo
340 days ago
Parsing expression grammars (pegs) are usually IME more maintainable long term, partially just because of much more testable and composable they are
1 comments
afiori
340 days ago
I suspect but am not sure that PEGs cannot do negative nor positive lookbehind, but it is not a very used feature.
link
girvo
340 days ago
Yeah that’s true IIRC but it’s rarely been a problem for my usage!
link