News for hackers. Stuff that matters.
Re:Writing Your Own Programming Language by btilly on Thursday November 10, 2016 @12:11PM (#12922156)
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.

Re:Writing Your Own Programming Language by kd0amg on Thursday November 10, 2016 @01:40PM (#12922977)
Yes, NFA! DFA only if it's LL(1).