|
|
|
|
|
|
by tom_mellior
2382 days ago
|
|
|
> Compiles to NFAs. No. It cannot, since NFAs cannot parse languages that are not regular. Rather, the algorithm executes like a pushdown automaton. I don't think it's correct to call this compilation. > I cannot decipher from the article the exact expressive power. To me it seems to suggest being able to parse (exactly) all context-free languages. |
|
|