diff options
| author | Pablo Galindo <Pablogsal@gmail.com> | 2019-09-09 14:08:23 (GMT) |
|---|---|---|
| committer | GitHub <noreply@github.com> | 2019-09-09 14:08:23 (GMT) |
| commit | c638521dbf8862d63151e4b984c9b586a954db4c (patch) | |
| tree | bceff13e527af718e48af1b6659216cc7680d5c1 | |
| parent | d5fd75c53fad7049fc640c9a6162d35f0c5bea03 (diff) | |
| download | cpython-c638521dbf8862d63151e4b984c9b586a954db4c.zip cpython-c638521dbf8862d63151e4b984c9b586a954db4c.tar.gz cpython-c638521dbf8862d63151e4b984c9b586a954db4c.tar.bz2 | |
Fix typo in the algorithm description (GH-15774)
| -rw-r--r-- | Parser/pgen/automata.py | 2 |
1 files changed, 1 insertions, 1 deletions
diff --git a/Parser/pgen/automata.py b/Parser/pgen/automata.py index 3147d86..545a737 100644 --- a/Parser/pgen/automata.py +++ b/Parser/pgen/automata.py @@ -242,7 +242,7 @@ class DFA: # Now create new DFAs by visiting all posible transitions between # the current DFA state and the new power-set states (each nfa_set) # via the different labels. As the nodes are appended to *states* this - # is performing a deep-first search traversal over the power-set of + # is performing a breadth-first search traversal over the power-set of # the states of the original NFA. for label, nfa_set in sorted(arcs.items()): for exisisting_state in states: |