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/kernel/Kernel/Reachability/index.html

Module Kernel.ReachabilitySource

This module computes the reachability of states in a parser automaton. It is used to reason about the behavior of an LR(1) automaton after conflict resolution (with some transitions removed). The module implements algorithms for partitioning lookahead symbols with identical behaviors, and uses these partitions to determine the cost of reaching each state with a given lookahead.

Sourcemodule type S = sig ... end
Sourcetype 'g t = (module S with type g = 'g)
Sourcetype ('g, 'cell) t_cell = (module S with type g = 'g and type Cell.n = 'cell)
Sourceval make : 'g Info.grammar -> 'g t