2 ms·
Don't you mean an NFA? If there is an ambiguity in the grammar that takes some time to resolve, a recursive descent parser can easily take exponential time. W
by btilly 10y ago
Don't you mean an NFA?
If there is an ambiguity in the grammar that takes some time to resolve, a recursive descent parser can easily take exponential time. What tail call elimination does is keep you from having a giant call stack, but does not fix the potential (though rare) performance disaster.
- kd0amg 10y agoYes, NFA! DFA only if it's LL(1).