Re:Atom now using Io.js
by cordite on Tuesday February 03, 2015 @06:09PM
(#8994178)
It can be, it can also be a context free grammar, which is 'higher' than a state machine (or regular expression)
[ Parent
| on HN ]
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?