package lrgrep

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

Install

dune-project
 Dependency

Authors

Maintainers

Sources

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

doc/fix/Fix/Numbering/index.html

Module Fix.NumberingSource

This module offers a facility for assigning a unique number to each value in a certain finite set and translating (both ways) between values and their numbers.

Sourcemodule Make (M : sig ... end) : sig ... end

The functor Make requires an implementation of maps for the type M.key and offers a two-phase numbering facility. The function encode is backed by a map, therefore runs in logarithmic time or constant time, depending on the type of map that is used. The function decode is backed by an array of size n, therefore runs in constant time.

Sourcemodule ForOrderedType (T : sig ... end) : sig ... end

ForOrderedType is a special case of Make where it suffices for keys to be ordered.

Sourcemodule ForHashedType (T : sig ... end) : sig ... end

ForHashedType is a special case of Make where it suffices for keys to be hashed.

Sourcemodule ForType (T : sig ... end) : sig ... end

ForType is a special case of Make where keys can have arbitrary type. OCaml's built-in generic equality and hash functions are used.