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/Automata/index.html

Module Kernel.AutomataSource

This module is responsible for generating a deterministic finite automaton (DFA) from a given grammar and lookahead set. The DFA is used to perform pattern matching on input tokens according to the grammar rules. The module includes several stages:

  • Construction of a big DFA from the grammar and lookahead set.
  • Minimization of the DFA.
  • Generation of output code for the minimized DFA. The module uses various data structures and algorithms to ensure efficient construction and minimization of the DFA, as well as to generate the corresponding OCaml code.
Sourcetype ('g, 'n) stacks = {
  1. domain : 'n Fix.Indexing.cardinal;
  2. tops : 'n Utils.Misc.indexset;
  3. prev : 'n Fix.Indexing.index -> 'n Utils.Misc.indexset;
  4. label : 'n Fix.Indexing.index -> 'g Info.lr1 Fix.Indexing.index;
}
Sourcetype priority = int
Sourceval label_to_short_string : 'a Kernel__Info.grammar -> 'a Info.Lr1.n Utils.IndexSet.t -> string
Sourceval string_of_cap : Regexp.Capture.t -> string
Sourcemodule NFA : sig ... end
Sourcemodule DFA : sig ... end
Sourcemodule Dataflow : sig ... end
Sourcemodule Machine : sig ... end