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.tar.gz

sha256=585297372d7f6cfb830214e9ef22d6d072a39b2a1591ef90f1ee2bcfe144cad3

md5=6bb6a7ba88bf2c7595a0b332921e60b4

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

Module `Cf_lex_scan.Create`

Use Create(B) to make a lexical analyzing scanner.

Parameters

module B : Basis

Signature

module DFA : Cf_dfa.Regular with type event := B.symbol

The regular syntax terms.

val string_to_term : string -> DFA.term

Use string_to_term s to make a DFA term that represents the regular expression denoted by s.

val simple : DFA.term -> B.lexeme B.form B.Scan.t

Use simple t to make a scanner that produces lexemes matching t.

type 'a rule

The type of a lexical analyzer rule.

val rule : DFA.term -> (B.lexeme B.form -> 'a) -> 'a rule

Use rule t f to make a rule to apply lexemes that match t to the production function f to make the value produced by the analyzer.

val analyze : 'a rule Seq.t -> 'a B.Scan.t

Use analyze s to make a lexical analyzing scanner that produces the annotated value from the first rule in s that matches the longest lexeme accepted by the DFA.

module Affix : sig ... end

This module contains useful affix operators.

On This Page

Parameters
Signature