Parsing expression grammars (pegs) are usually IME more maintainable long term, ... | Hacker News

Hacker Newsnew | past | comments | ask | show | jobs | submit

		girvo 8 months ago \| parent \| context \| favorite \| on: Why LLMs Can't Write Q/Kdb+: Writing Code Right-to... Parsing expression grammars (pegs) are usually IME more maintainable long term, partially just because of much more testable and composable they are

afiori 8 months ago [–]

I suspect but am not sure that PEGs cannot do negative nor positive lookbehind, but it is not a very used feature.

girvo 8 months ago | [–]

Yeah that’s true IIRC but it’s rarely been a problem for my usage!

Guidelines | FAQ | Lists | API | Security | Legal | Apply to YC | Contact