traverseda
/
cpython
1
0
Fork 0
Code Issues Pull Requests Releases Wiki Activity

Fix typo in the algorithm description (GH-15774)

This commit is contained in:
Pablo Galindo 2019-09-09 15:08:23 +01:00 committed by GitHub
parent d5fd75c53f
commit c638521dbf
No known key found for this signature in database
GPG Key ID: 4AEE18F83AFDEB23
1 changed files with 1 additions and 1 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

2
Parser/pgen/automata.py
View File

@ -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: