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/utils/Utils/Refine/index.html

Module Utils.RefineSource

Refine computes the refined partition of a list of overlapping set: the smallest list of non-overlapping sets such that each set is a subset of one of the input set.

This is useful when computing the set of transitions of a DFA when the alphabet is large: rather than representing a transition for each letter separately, we group them by subset having the same destination.

Sourcemodule type DECOMPOSABLE = sig ... end
Sourcemodule type S = sig ... end

The type of refined sets

Sourcemodule Make (Set : DECOMPOSABLE) : S with type 'a t := 'a Set.t