package orsetto

You can search for identifiers within the package.

in-package search v0.2.0

A library of assorted structured data interchange languages

Install

Dune Dependency

bitbucket.org Edit opam file Versions (8)

Authors

J

james woodyatt <jhw@conjury.org>

Maintainers

J

james woodyatt <jhw@conjury.org>

Sources

r1.0.1.tar.gz

sha256=f64814687276bad56483b2b8dfaaf70d0d6485f67fe5d44bff34bfa47af1896e

md5=3a15a377800cf988a310b4082406c685

doc/orsetto.cf/Cf_lex_scan/Create/Affix/index.html

Module `Create.Affix`

This module contains useful affix operators.

Include the affix operators for the DFA module.

include Cf_dfa.Affix
  with type event := B.symbol
   and type term := DFA.term
   and type 'r fin := 'r DFA.fin

val (!:) : B.symbol -> DFA.term

Use !: event as one event.

val (!^) : (B.symbol -> bool) -> DFA.term

Use !^ f as sat f.

val (!?) : DFA.term -> DFA.term

Use !? term as opt term

val (!*) : DFA.term -> DFA.term

Use !* term as star term

val (!+) : DFA.term -> DFA.term

Use !+ term as seq ~a:1 term

val ($|) : DFA.term -> DFA.term -> DFA.term

Use a $| b as alt2 a b

val ($&) : DFA.term -> DFA.term -> DFA.term

Use a $& b as cat2 a b

val ($=) : DFA.term -> 'r -> 'r DFA.fin

Use term $= v as fin term v

val (!$) : string -> DFA.term

Use !$ s as string_to_term s.

val (?$$) : string -> B.lexeme B.form B.Scan.t

Use ?$$ s as simple (string_to_form s).

val ($$>) : string -> (B.lexeme B.form -> 'a) -> 'a rule

Use t $$> f as rule (string_to_form s) f.