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.3.tar.gz
sha512=9b654edb663ae697563f150824047052f3b1bf760398f24bce6350553f031f73c46b6337239a1acd871e61238597ea92046809e3358290ff14d6ba671b449085

doc/orsetto.ucs/Ucs_lex_scan/Create/index.html

Module Ucs_lex_scan.Create

Use Create(S) to make a lexical analyzer for the Unicode scanner S.

Parameters

Signature

module DFA : Cf_dfa.Regular with type event := Uchar.t

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 -> (Ucs_text.t S.Annot.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 S.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.