3 ms·
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 s
by hyperpape 12y ago
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 12y agoI mentioned Haskell above. It has nested block comments which should be balanced. Thus CFG.