Forlan Manual

The `TranReg` Module

Synopsis

signature TRAN_REG structure TranReg :> TRAN_REG

This module defines the concrete type of regular expression finite automata transitions.

Interface

type tran_reg = Sym.sym * Reg.reg * Sym.sym val compare : tran_reg Sort.total_ordering val equal : tran_reg * tran_reg -> bool

Description

type tran_reg = Sym.sym * Reg.reg * Sym.sym: The type of regular expression transitions.

compare: is Set.compareTriple(Sym.compare, Reg.compare, Sym.compare).

equal(tran1, tran2): tests whether tran1 and tran2 are equal.

[ Top | Parent | Root | Contents | Index ]

Forlan Version 4.15
Copyright © 2022 Alley Stoughton