package orsetto

  1. Overview
  2. Docs
A library of assorted structured data interchange languages

Install 

dune-project
 Dependency

bitbucket.org Edit opam file Versions (8)

Authors

  1. J
    james woodyatt <jhw@conjury.org>

Maintainers

  1. J
    james woodyatt <jhw@conjury.org>

Sources

r1.1.2.tar.gz
sha512=e260412b2dd0f98cfe3dc7ed5c31a694eb31c93cd207c51fa12675b790234ee0ad3bf07d9be17a4dc266fedfe55b14c967cad7bc0c9414063eef8afd59f3d0d1

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.

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.