Skip to content
GitLab
Menu
Projects
Groups
Snippets
Help
Help
Support
Community forum
Keyboard shortcuts
?
Submit feedback
Contribute to GitLab
Sign in
Toggle navigation
Menu
Open sidebar
POTTIER Francois
menhir
Commits
2c5fb035
Commit
2c5fb035
authored
Jul 17, 2015
by
POTTIER Francois
Browse files
Comment.
parent
c244e4b0
Changes
1
Show whitespace changes
Inline
Side-by-side
src/LRijkstra.ml
View file @
2c5fb035
...
...
@@ -758,4 +758,16 @@ let () =
write to .coverage file
remove Coverage, remove CompletedNatWitness?, revert Fix
collect performance data, correlated with star size and alphabet size; draw a graph
count the unreachable states and see if they are numerous in practice
*)
(* One could approach the problem just by exploring the (infinite) graph whose
vertices are configurations of the LR automaton (i.e., stacks, or perhaps
pairs of a stack and a lookahead symbol) and transitions are determined by
feeding one symbol to the automaton. A small-step version of the reference
interpreter would allow us to set this up easily. One could then run a
breadth-first exploration of this graph and stop when desired, e.g., as
soon as all automaton states have been reached. However, this process does
not necessarily terminate, and could be very costly -- e.g. enumerating all
sentences of length 10 when the alphabet has size 100 costs 10^20. Also,
this approach cannot prove that a state is unreachable. *)
Write
Preview
Supports
Markdown
0%
Try again
or
attach a new file
.
Attach a file
Cancel
You are about to add
0
people
to the discussion. Proceed with caution.
Finish editing this message first!
Cancel
Please
register
or
sign in
to comment