package lrgrep

  1. Overview
  2. Docs
Analyse the stack of a Menhir-generated LR parser using regular expressions

Install 

dune-project
 Dependency

github.com Readme Changelog Edit opam file Versions (1)

Authors

  1. F
    Frederic Bour <frederic.bour@lakaban.net>

Maintainers

  1. F
    Frederic Bour <frederic.bour@lakaban.net>

Sources

lrgrep-0.3.tbz
sha256=84a1874d0c063da371e19c84243aac7c40bfcb9aaf204251e0eb0d1f077f2cde
sha512=5a16ff42a196fd741bc64a1bdd45b4dca0098633e73aa665829a44625ec15382891c3643fa210dbe3704336eab095d4024e093e37ae5313810f6754de6119d55

doc/kernel/Kernel/Enumeration/index.html

Module Kernel.EnumerationSource

Sourceval kernel : 'a Fix.Indexing.index -> ?goto:int -> 'b Info.terminal Utils.Misc.indexset -> ('b, 'a) kernel
Sourcetype ('lrc, 'n) edge = {
  1. path : 'lrc Fix.Indexing.index list;
  2. source : 'n Fix.Indexing.index;
  3. target : 'n Fix.Indexing.index;
}
Sourcetype ('g, 'lrc, 'a, 'n) _graph = {
  1. ker : ('n, ('g, 'lrc) kernel) Fix.Indexing.vector;
  2. fwd : ('n, ('lrc, 'n) edge list) Fix.Indexing.vector;
  3. bkd : ('n, ('lrc, 'n) edge list) Fix.Indexing.vector;
  4. entries : 'a array;
}
Sourcetype ('g, 'lrc, 'a) graph =
  1. | Graph : ('g, 'lrc, 'a, 'n) _graph -> ('g, 'lrc, 'a) graph
Sourceval fold_expand : ('a -> 'a) -> 'a -> ('a -> 'b -> 'c -> 'b) -> 'b -> 'c list -> 'b
Sourceval make_graph : 'g Info.grammar -> ('g Info.lr1, 'g Redgraph.reduction_closure) Fix.Indexing.vector -> ('g, 'lrc) Automata.stacks -> (('g, 'lrc) kernel * 'a) list -> ('g, 'lrc, 'a) graph
Sourceval get_lr1_state : 'a Kernel__Info.grammar -> ('a, 'b) Automata.stacks -> ('a, 'b) kernel -> 'a Info.lr1 Fix.Indexing.index
Sourceval get_lr0_state : 'a Kernel__Info.grammar -> ('a, 'b) Automata.stacks -> ('a, 'b) kernel -> 'a Kernel__Info.lr0 Fix.Indexing.index
Sourceval get_failing : 'a Kernel__Info.grammar -> ('a, 'b) Automata.stacks -> ('a Info.lr1, 'c Redgraph.reduction_closure) Fix.Indexing.Vector.t -> ('a, 'b) kernel -> 'c Info.terminal Utils.Misc.indexset
Sourcetype ('g, 'lrc, 'a, 'n) failing_sentence = {
  1. first : 'n Fix.Indexing.index;
  2. pattern : 'g Info.lr0 Fix.Indexing.index;
  3. edges : ('lrc, 'n) edge list;
  4. failing : 'g Info.terminal Utils.Misc.indexset;
  5. entry : 'a;
}
Sourceval make_failing_sentence : ('a, 'b, 'c, 'd) _graph -> ('e Fix.Indexing.index * 'f Info.lr0 Fix.Indexing.index * ('g, 'e) edge list * 'f Info.terminal Utils.Misc.indexset) -> ('f, 'g, 'c, 'e) failing_sentence
Sourceval cover_with_maximal_patterns : 'a Kernel__Info.grammar -> ('a Info.lr1, 'a Redgraph.reduction_closure) Fix.Indexing.Vector.t -> ('a, 'b) Automata.stacks -> ('a, 'b, 'c, 'd) _graph -> ('a, 'b, 'c, 'd) failing_sentence list
Sourcetype ('g, 'a) dispenser = {
  1. fallible0 : ('g Info.lr0, 'g Info.terminal Utils.Misc.indexset) Fix.Indexing.vector;
  2. mutable next : 'a Stdlib.Seq.t;
}
Sourceval mark_covered : ('a, 'b) dispenser -> int -> 'a Info.terminal Utils.IndexSet.t -> unit
Sourceval mark_sentence_covered : 'a Kernel__Info.grammar -> ('a, 'b) Automata.stacks -> ('a, 'b, 'c, 'd) _graph -> ('a, 'e) dispenser -> ('a, 'f, 'g, 'd) failing_sentence -> unit
Sourceval next : ('a, 'b) dispenser -> 'b option
Sourceval to_seq : ('a, 'b) dispenser -> 'b Stdlib.Seq.t
Sourceval cover_all : 'g Kernel__Info.grammar -> ('g Info.lr1, 'g Redgraph.reduction_closure) Fix.Indexing.Vector.t -> ('g, 'a) Automata.stacks -> ('g, 'a, 'b, 'n) _graph -> ('g, ('g, 'a, 'b, 'n) failing_sentence) dispenser