package lrgrep

You can search for identifiers within the package.

in-package search v0.2.0

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

F

Frederic Bour <frederic.bour@lakaban.net>

Maintainers

F

Frederic Bour <frederic.bour@lakaban.net>

Sources

lrgrep-0.3.tbz

sha256=84a1874d0c063da371e19c84243aac7c40bfcb9aaf204251e0eb0d1f077f2cde

sha512=5a16ff42a196fd741bc64a1bdd45b4dca0098633e73aa665829a44625ec15382891c3643fa210dbe3704336eab095d4024e093e37ae5313810f6754de6119d55

doc/fix/Fix/DataFlow/ForIntSegment/argument-3-G/index.html

Parameter `ForIntSegment.G`

type variable = int

The type of variables, or graph vertices.

type property = P.property

The type of properties.

val foreach_root : (variable -> property -> unit) -> unit

foreach_root describes the root nodes of the data flow graph as well as the properties associated with them. foreach_root contribute must call contribute x p to indicate that x is a root and that p is a lower bound on the solution at x. It may call contribute x _ several times at a single root x.

val foreach_successor : 
  variable ->
  property ->
  (variable -> property -> unit) ->
  unit

foreach_successor describes the edges of the data flow graph as well as the manner in which a property at the source of an edge is transformed into a property at the target. The property at the target must of course be a monotonic function of the property at the source.