Commit 5c4d7e6f authored by POTTIER Francois's avatar POTTIER Francois

Time loop detection.

parent 205bdbe3
Pipeline #200803 passed with stages
in 1 minute
......@@ -173,8 +173,8 @@ let fail prod =
(Production.print prod)
(Symbol.print rhs.(0))
(Symbol.print (Symbol.N nt))
(* Furthermore, this creates a shift/reduce conflict, which, if it were
resolved in favor of reduction, would cause the parser to diverge. *)
(* Furthermore, this creates a shift/reduce conflict, which (if resolved
in favor of reduction) can cause the parser to diverge. *)
(* To detect hidden left recursion in linear time, we first compute the
strongly connected components of the relation S. Then, we check every edge
......@@ -207,4 +207,7 @@ let () =
(* -------------------------------------------------------------------------- *)
let () =
Time.tick "Running loop detection"
end (* Run *)
Markdown is supported
0% or .
You are about to add 0 people to the discussion. Proceed with caution.
Finish editing this message first!
Please register or to comment