But there are also higher complexity bounds on CFGs (since they include regular ... | Hacker News

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

		hyperpape on Feb 4, 2015 \| parent \| context \| favorite \| on: Atom now using Io.js But there are also higher complexity bounds on CFGs (since they include regular expressions, they certainly can't be lower). In any case, I've never heard of someone using non-regular expression CFGs for lexing. Are there cases?

thesz on Feb 4, 2015 [–]

I mentioned Haskell above. It has nested block comments which should be balanced. Thus CFG.

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