Redgraph (p.lrgrep.0.3.doc.kernel.Kernel.Redgraph)

Sourcetype 'g stack_tree = {

subs : ('g Info.lr1 Fix.Indexing.index list * 'g Info.terminal Utils.Misc.indexset * 'g stack_tree) list;

}

Sourcetype 'g reduction_closure = {

accepting : 'g Info.terminal Utils.Misc.indexset;
failing : 'g Info.terminal Utils.Misc.indexset;
reductions : ('g Info.nonterminal, 'g Info.terminal Utils.Misc.indexset) Utils.Misc.indexmap list;
stacks : 'g stack_tree;

}

type ('g, 'n) reduction_closures =
  ('n, 'g reduction_closure) Fix.Indexing.vector

Source

val close_lr1_reductions : 
  'g Info.grammar ->
  ('g, 'g Info.lr1) reduction_closures

Source

val dump_closure : 
  ?failing:bool ->
  'g Info.grammar ->
  ('n Fix.Indexing.index -> string) ->
  ('n, 'g reduction_closure) Fix.Indexing.vector ->
  unit

Sourcetype 'g target

Source

type 'g targets =
  ('g target, 'g Info.terminal Utils.Misc.indexset) Utils.Misc.indexmap

Sourcetype 'g target_trie = private {

mutable sub : ('g Info.lr1, 'g target_trie) Utils.Misc.indexmap;
mutable immediates : 'g Info.lr1 Utils.Misc.indexset;
mutable targets : ('g Info.lr1, 'g target Fix.Indexing.index) Utils.Misc.indexmap;

}

Source

val index_targets : 
  'g Info.grammar ->
  ('g, 'g Info.lr1) reduction_closures ->
  'g target_trie * ('g Info.goto_transition, 'g targets) Fix.Indexing.vector

Sourcetype 'g graph

Source

val make : 
  'g Info.grammar ->
  ('g, 'g Info.lr1) reduction_closures ->
  ('g Info.goto_transition, 'g targets) Fix.Indexing.vector ->
  'g graph

Sourcetype 'g step

Sourcetype 'g transition = {

reached : 'g target Utils.Misc.indexset;
reachable : 'g target Utils.Misc.indexset;
step : 'g step Fix.Indexing.index;

}

Sourcetype 'g action =

| Advance of 'g step Fix.Indexing.index
| 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