Keep partially dead states in the lexer

They are important.
baioc · Aug 12, 2021 · 4e6b2ee · 4e6b2ee
1 parent 5bbeb5a
commit 4e6b2ee
Showing 1 changed file with 9 additions and 11 deletions.
diff --git a/src/Shared/Shared.fs b/src/Shared/Shared.fs
@@ -132,22 +132,20 @@ module Lexer =
             union
             |> Dfa.filter (fun (q, a) q' -> q' <> set [ dead ])
             |> Dfa.map
-                (fun s ->
-                    s
-                    |> Seq.filter (fun state -> state <> dead)
-                    |> Seq.map
-                        (fun (prefix, state) ->
-                            if Set.contains s union.Accepting then
+                (fun state ->
+                    Set.map
+                        (fun (prefix, discriminant) ->
+                            if Set.contains state union.Accepting then
                                 match Map.tryFind prefix spec with
                                 | Some (TokenClass (r, priority)) ->
-                                    AcceptToken (prefix, state, priority)
+                                    AcceptToken (prefix, discriminant, priority)
                                 | Some (Separator r) ->
-                                    AcceptSeparator (prefix, state)
+                                    AcceptSeparator (prefix, discriminant)
                                 | notAccepting ->
-                                    Intermediary (prefix, state)
+                                    Intermediary (prefix, discriminant)
                             else
-                                Intermediary (prefix, state))
-                    |> Set.ofSeq)
+                                Intermediary (prefix, discriminant))
+                        state)
 
         { Automaton = automaton; Initial = automaton.Current
           String = ""; Start = 0u; Position = 0u }