package lrgrep

  1. Overview
  2. Docs

Module Kernel.RedgraphSource

Sourcetype 'g stack_tree = {
  1. subs : ('g Info.lr1 Fix.Indexing.index list * 'g Info.terminal Utils.Misc.indexset * 'g stack_tree) list;
}
Sourcetype 'g reduction_closure = {
  1. accepting : 'g Info.terminal Utils.Misc.indexset;
  2. failing : 'g Info.terminal Utils.Misc.indexset;
  3. reductions : ('g Info.nonterminal, 'g Info.terminal Utils.Misc.indexset) Utils.Misc.indexmap list;
  4. stacks : 'g stack_tree;
}
Sourcetype ('g, 'n) reduction_closures = ('n, 'g reduction_closure) Fix.Indexing.vector
Sourceval close_lr1_reductions : 'g Info.grammar -> ('g, 'g Info.lr1) reduction_closures
Sourceval dump_closure : ?failing:bool -> 'g Info.grammar -> ('n Fix.Indexing.index -> string) -> ('n, 'g reduction_closure) Fix.Indexing.vector -> unit
Sourcetype 'g target
Sourcetype 'g target_trie = private {
  1. mutable sub : ('g Info.lr1, 'g target_trie) Utils.Misc.indexmap;
  2. mutable immediates : 'g Info.lr1 Utils.Misc.indexset;
  3. mutable targets : ('g Info.lr1, 'g target Fix.Indexing.index) Utils.Misc.indexmap;
}
Sourcetype 'g graph
Sourcetype 'g step
Sourcetype 'g transition = {
  1. reached : 'g target Utils.Misc.indexset;
  2. reachable : 'g target Utils.Misc.indexset;
  3. step : 'g step Fix.Indexing.index;
}
Sourcetype 'g action =
  1. | Advance of 'g step Fix.Indexing.index
  2. | Switch of ('g Info.lr1, 'g transition list) Utils.Misc.indexmap
Sourceval initial : 'g graph -> 'g Info.lr1 Fix.Indexing.index -> 'g transition list
Sourceval follow : 'g graph -> 'g step Fix.Indexing.index -> 'g action