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

Module Utils.MiscSource

module Positive : sig ... end
Sourceval compare_ignore : 'a -> 'b -> int
Sourceval compare_pair : ('a -> 'b -> int) -> ('c -> 'd -> int) -> ('a * 'c) -> ('b * 'd) -> int
Sourceval compare_fst : ('a -> 'b -> int) -> ('a * 'c) -> ('b * 'd) -> int
Sourceval compare_snd : ('a -> 'b -> int) -> ('c * 'a) -> ('d * 'b) -> int
Sourceval array_last : 'a array -> 'a option

array_last arr returns the Some x where x is the last element of the array, or None if the array is empty

Sourceval array_findi : (int -> 'a -> bool) -> int -> 'a array -> int

array_findi f i arr finds the smallest j >= i such that f j arr.(j) = true, or raises Not_found if there is no such j

Sourceval array_split : ('a * 'b) array -> 'a array * 'b array
Sourceval array_compare : ('a -> 'b -> int) -> 'a array -> 'b array -> int
Sourceval array_equal : ('a -> 'b -> bool) -> 'a array -> 'b array -> bool
Sourceval group_by : compare:('a -> 'a -> int) -> group:('a -> 'a list -> 'b) -> 'a list -> 'b list

group ~compare ~group list Group togethers the elements of list that are equivalent according to compare, using the group function

Sourceval merge_group : equal:('b -> 'b -> bool) -> group:('b -> 'a list -> 'c) -> ('a * 'b) list -> 'c list

Merge consecutive elements (a, b) of list that have the same b, according to equal.

Sourcetype 'a indexset = 'a IndexSet.t

Convenient alias for IndexSet

Sourcetype ('n, 'a) indexmap = ('n, 'a) IndexMap.t

Convenient alias for IndexMap

Sourceval cons_update : 'a -> 'a list option -> 'a list option

A function for consing a value when using Map.update

Sourceval add_update : 'a IndexSet.element -> 'a IndexSet.t option -> 'a IndexSet.t option

A function for adding an element to a set when using Map.update

Sourceval union_update : 'a IndexSet.t -> 'a IndexSet.t option -> 'a IndexSet.t option

A function for unioning sets when using Map.update

Sourceval (@) : 'a list -> 'a list -> 'a list

Optimize stdlib's (@) to avoid copying the lhs when the rhs is empty

Sourceval array_cons : 'a list array -> int -> 'a -> unit

array_cons a i v cons the value v to the list a.(i), where a is an array of list.

Sourceval index_fold : 'a Fix__Indexing.cardinal -> 'b -> (int -> 'b -> 'b) -> 'b

index_fold n a f fold f with accumulator a over all indices in the finite set of cardinal n

Sourceval (.:()) : ('a, 'b) Fix.Indexing.Vector.t -> int -> 'b

Vector get

Sourceval (.:()<-) : ('a, 'b) Fix.Indexing.Vector.t -> int -> 'b -> unit

Vector set

Sourceval (.@()<-) : ('a, 'b) Fix.Indexing.Vector.t -> int -> ('b -> 'b) -> unit

Vector update

Sourceval tabulate_finset : 'a Fix__Indexing.cardinal -> (int -> 'b) -> int -> 'b

tabulate_finset n f tabulates function f over all indices in the finite set of cardinal n

Sourceval relation_reverse' : 'a Fix__Indexing.cardinal -> ('a IndexSet.element -> 'a IndexSet.t) -> ('a, 'a IndexSet.t) Fix.Indexing.Vector.t
Sourceval relation_reverse : 'a Fix__Indexing.cardinal -> ('b, 'a IndexSet.t) Fix.Indexing.Vector.t -> ('a, 'b IndexSet.t) Fix.Indexing.Vector.t
Sourceval fix_relation : ('n, 'n indexset) Fix.Indexing.vector -> ('n, 'a) Fix.Indexing.vector -> propagate:('n Fix.Indexing.index -> 'a -> 'n Fix.Indexing.index -> 'a -> 'a) -> unit
Sourceval close_relation : ?reverse:('a, 'a IndexSet.t) Fix.Indexing.Vector.t -> ('a, 'a IndexSet.t) Fix.Indexing.Vector.t -> unit
Sourceval equal_index : 'a Fix.Indexing.index -> 'a Fix.Indexing.index -> bool

Equality on indices

Sourceval compare_index : 'a Fix.Indexing.index -> 'a Fix.Indexing.index -> int

Comparison of indices

Sourceval string_concat_map : ?wrap:(string * string) -> string -> ('a -> string) -> 'a list -> string

string_concat_map ~wrap:(pre, post) sep f xs returns a string made of the concatenation of the elements of xs printed by function f and separated by sep. wrap is optional, but if provided, pre is prepended to the result and post is appended.

Sourceval string_of_index : 'a Fix.Indexing.index -> string
Sourceval string_of_indexset : ?index:('a Fix.Indexing.index -> string) -> 'a IndexSet.t -> string
Sourceval push : 'a list Stdlib.ref -> 'a -> unit

Prepend an element to a list reference

Sourceval pushs : 'a list Stdlib.ref -> 'a list -> unit

Prepend elements to a list reference

Sourceval hash_list : ('a -> 'b) -> 'a list -> int
Sourceval merge_uniq : ('a -> 'a -> int) -> 'a list -> 'a list -> 'a list

Merge to ordered lists, keeping only one copy of elements occurring in both lists. (Duplicate elements in the same list are kept.)

Sourceval cons_option : 'a option -> 'a list -> 'a list

List cons where the element to cons is optional

Sourceval cons_if : bool -> 'a -> 'a list -> 'a list
Sourceval cmon_index : 'a Fix.Indexing.index -> Cmon.t

Turns a index into a cmon document

Sourceval cmon_indexset : ?index:('a Fix.Indexing.index -> Cmon.t) -> 'a IndexSet.t -> Cmon.t

Turns a set of indices into a cmon document

Sourceval cmon_set_cardinal : 'a IndexSet.t -> Cmon.t
Sourceval cmon_pair : ('a -> Cmon.t) -> ('b -> Cmon.t) -> ('a * 'b) -> Cmon.t
Sourceval cmon_option : ('a -> Cmon.t) -> 'a option -> Cmon.t
Sourceval print_cmon : PPrint.ToChannel.channel -> Cmon.t -> unit

Print a cmon document to a channel with sensible defaults

Sourceval sort_and_merge : ('a -> 'a -> int) -> ('a -> 'a list -> 'b) -> 'a list -> 'b list
Sourceval sort_and_merge_indexed : ('a -> 'a -> int) -> ('a * 'b IndexSet.t) list -> ('a * 'b IndexSet.t) list
Sourceval list_foralli : (int -> 'a -> bool) -> 'a list -> bool
Sourceval list_rev_iter : ('a -> unit) -> 'a list -> unit
Sourceval list_drop : int -> 'a list -> 'a list
Sourceval list_take : int -> 'a list -> 'a list
Sourceval fixpoint : ?counter:int Stdlib.ref -> propagate:('a -> unit) -> 'a list Stdlib.ref -> unit
Sourceval assert_equal_length : ('a, 'b) Fix.Indexing.Vector.t -> ('c, 'd) Fix.Indexing.Vector.t -> ('a, 'c) Fix.Indexing.eq
Sourceval bytes_match : bytes -> int -> string -> bool
Sourceval verbosity_level : int Stdlib.ref
Sourceval stopwatch_delta : int -> float
Sourceval stopwatch_counter : int Stdlib.ref
Sourceval stopwatch_perfs : (bool * int) list Stdlib.ref
Sourceval stopwatch_perf_step : int -> bool option
Sourceval stopwatch : int -> ('a, Stdlib.out_channel, unit, unit) Stdlib.format4 -> 'a
Sourceval rewrite_keywords : (Stdlib.Lexing.position -> string -> string -> bool) -> Stdlib.Lexing.position -> string -> string
Sourcetype 'a lazy_stream = {
  1. lvalue : 'a;
  2. lnext : 'a lazy_stream lazy_t;
}
Sourceval iterate : 'a -> ('a -> 'a) -> 'a lazy_stream
Sourceval list_rev_mappend : ('a -> 'b) -> 'a list -> 'b list -> 'b list
Sourceval list_is_empty : 'a list -> bool
Sourceval seq_singleton : 'a -> unit -> 'a Stdlib.Seq.node
Sourceval seq_memoize : 'a Stdlib.Seq.t -> 'a Stdlib.Seq.t
Sourceval seq_mapi : (int -> 'a -> 'b) -> 'a Stdlib.Seq.t -> unit -> 'b Stdlib.Seq.node
Sourcemodule Damerau_levenshtein : sig ... end
Sourceval print_dym : ('a -> string) -> Stdlib.out_channel -> 'a list -> unit