tags:

views:

70

answers:

1

Does anybody know if Python (any version) used NFAs (Non-Deterministic Finite Automata) to evaluate regular expressions or does it use some other mechanism? Please provide links/reference if available.

+2  A: 

NFA.

See Friedl's Mastering Regular Expressions, 3rd edition, chapter 4 - table 4-1, page 145.

Google books has a preview to it.

Bart Kiers
Good reference. Thanks.
Johan
You're welcome Johan.
Bart Kiers