Lines Matching refs:NFA
10 #include "NFA.h"
22 * DFAs differ only in that an NFA allows multiple states at the same time, we can find each
23 * possible combination of simultaneous NFA states and give this combination a label. These labelled
24 * nodes are our DFA nodes, since we can only be in one such unique set of NFA states at a time.
26 * As an NFA can end up in multiple accept states at the same time (for instance, the token "while"
28 * (in terms of the order in which they were added to the NFA).
35 NFAtoDFA(NFA* nfa)
36 : fNFA(*nfa) {}
39 * Returns a DFA created from the NFA.
44 // create a state representing being in all of the NFA's start states at once
160 const NFA& fNFA;
