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/fix/Fix/GraphNumbering/Make/index.html

Module GraphNumbering.MakeSource

Make(M)(G) produces a numbering of the graph G, or more precisely, of the subset of the vertices of G that are reachable from the roots. The type of the vertices must be equipped with an implementation of imperative maps.

Parameters

module M : sig ... end
module G : sig ... end

Signature

Sourcetype t = G.t

The type t of values of interest.

Sourceval n : int

n is the number of values of type t that have been encoded. The functions encode and decode represent an isomorphism between this subset of t and the interval [0..n).

Sourceval encode : t -> int

encode maps a value of type t to an integer code in the interval [0..n).

Sourceval decode : int -> t

decode maps an integer code in the interval [0..n) back to a value of type t.