From 8c348aee6f1d2dcefc1b8fe79586d52910f62779 Mon Sep 17 00:00:00 2001
From: Dave Halter <davidhalter88@gmail.com>
Date: Thu, 14 Jun 2018 10:29:19 +0200
Subject: [PATCH] Use NFAArc as a class

---
 parso/pgen2/grammar_parser.py | 12 ++++++---
 parso/pgen2/pgen.py           | 48 +++++++++++++++++------------------
 2 files changed, 33 insertions(+), 27 deletions(-)

diff --git a/parso/pgen2/grammar_parser.py b/parso/pgen2/grammar_parser.py
index 54f8c10..a8c9694 100644
--- a/parso/pgen2/grammar_parser.py
+++ b/parso/pgen2/grammar_parser.py
@@ -133,15 +133,21 @@ class GrammarParser():
                                 self.begin[1], line))
 
 
+class NFAArc(object):
+    def __init__(self, next_, label_or_string):
+        self.next = next_
+        self.label_or_string = label_or_string
+
+
 class NFAState(object):
     def __init__(self, from_rule):
         self.from_rule = from_rule
         self.arcs = []  # list of (label, NFAState) pairs
 
-    def add_arc(self, next, label=None):
+    def add_arc(self, next_, label=None):
         assert label is None or isinstance(label, str)
-        assert isinstance(next, NFAState)
-        self.arcs.append((label, next))
+        assert isinstance(next_, NFAState)
+        self.arcs.append(NFAArc(next_, label))
 
     def __repr__(self):
         return '<%s: from %s>' % (self.__class__.__name__, self.from_rule)
diff --git a/parso/pgen2/pgen.py b/parso/pgen2/pgen.py
index 6f9ca04..0ce14f4 100644
--- a/parso/pgen2/pgen.py
+++ b/parso/pgen2/pgen.py
@@ -39,14 +39,14 @@ class ParserGenerator(object):
             grammar.symbol2number[name] = i
             grammar.number2symbol[i] = name
         for name in names:
-            dfa = self._rule_to_dfas[name]
+            dfas = self._rule_to_dfas[name]
             states = []
-            for state in dfa:
+            for state in dfas:
                 arcs = []
                 for label, next in state.arcs.items():
-                    arcs.append((self._make_label(grammar, label), dfa.index(next)))
+                    arcs.append((self._make_label(grammar, label), dfas.index(next)))
                 if state.isfinal:
-                    arcs.append((0, dfa.index(state)))
+                    arcs.append((0, dfas.index(state)))
                 states.append(arcs)
             grammar.states.append(states)
             grammar.dfas[grammar.symbol2number[name]] = (states, self._make_first(grammar, name))
@@ -148,19 +148,19 @@ class ParserGenerator(object):
 
 
 class DFAState(object):
-    def __init__(self, nfaset, final):
-        assert isinstance(nfaset, dict)
-        assert isinstance(next(iter(nfaset)), NFAState)
+    def __init__(self, nfa_set, final):
+        assert isinstance(nfa_set, dict)
+        assert isinstance(next(iter(nfa_set)), NFAState)
         assert isinstance(final, NFAState)
-        self.nfaset = nfaset
-        self.isfinal = final in nfaset
+        self.nfa_set = nfa_set
+        self.isfinal = final in nfa_set
         self.arcs = {}  # map from label to DFAState
 
-    def add_arc(self, next, label):
+    def add_arc(self, next_, label):
         assert isinstance(label, str)
         assert label not in self.arcs
-        assert isinstance(next, DFAState)
-        self.arcs[label] = next
+        assert isinstance(next_, DFAState)
+        self.arcs[label] = next_
 
     def unifystate(self, old, new):
         for label, next in self.arcs.items():
@@ -168,7 +168,7 @@ class DFAState(object):
                 self.arcs[label] = new
 
     def __eq__(self, other):
-        # Equality test -- ignore the nfaset instance variable
+        # Equality test -- ignore the nfa_set instance variable
         assert isinstance(other, DFAState)
         if self.isfinal != other.isfinal:
             return False
@@ -219,27 +219,27 @@ def _make_dfas(start, finish):
         if state in base:
             return
         base[state] = 1
-        for label, next_ in state.arcs:
-            if label is None:
-                addclosure(next_, base)
+        for nfa_arc in state.arcs:
+            if nfa_arc.label_or_string is None:
+                addclosure(nfa_arc.next, base)
 
     base = {}
     addclosure(start, base)
     states = [DFAState(base, finish)]
     for state in states:  # NB states grows while we're iterating
         arcs = {}
-        for nfastate in state.nfaset:
-            for label, next_ in nfastate.arcs:
-                if label is not None:
-                    addclosure(next_, arcs.setdefault(label, {}))
-        for label, nfaset in arcs.items():
+        for nfa_state in state.nfa_set:
+            for nfa_arc in nfa_state.arcs:
+                if nfa_arc.label_or_string is not None:
+                    addclosure(nfa_arc.next, arcs.setdefault(nfa_arc.label_or_string, {}))
+        for label_or_string, nfa_set in arcs.items():
             for st in states:
-                if st.nfaset == nfaset:
+                if st.nfa_set == nfa_set:
                     break
             else:
-                st = DFAState(nfaset, finish)
+                st = DFAState(nfa_set, finish)
                 states.append(st)
-            state.add_arc(st, label)
+            state.add_arc(st, label_or_string)
     return states  # List of DFAState instances; first one is start