ocaml/lex/lexgen.mli

60 lines
1.9 KiB
OCaml

(***********************************************************************)
(* *)
(* Objective Caml *)
(* *)
(* Xavier Leroy, projet Cristal, INRIA Rocquencourt *)
(* *)
(* Copyright 1996 Institut National de Recherche en Informatique et *)
(* en Automatique. All rights reserved. This file is distributed *)
(* under the terms of the Q Public License version 1.0. *)
(* *)
(***********************************************************************)
(* $Id$ *)
(* raised when there are too many bindings (>= 254 memory cells) *)
exception Memory_overflow
(* Representation of automata *)
type automata =
Perform of int * tag_action list
| Shift of automata_trans * (automata_move * memory_action list) array
and automata_trans =
No_remember
| Remember of int * tag_action list
and automata_move =
Backtrack
| Goto of int
and memory_action =
| Copy of int * int
| Set of int
and tag_action = SetTag of int * int | EraseTag of int
(* Representation of entry points *)
type tag_base = Start | End | Mem of int
type tag_addr = Sum of (tag_base * int)
type ident_info =
| Ident_string of bool * tag_addr * tag_addr
| Ident_char of bool * tag_addr
type t_env = (string * ident_info) list
type ('args,'action) automata_entry =
{ auto_name: string;
auto_args: 'args ;
auto_mem_size : int ;
auto_initial_state: int * memory_action list ;
auto_actions: (int * t_env * 'action) list }
(* The entry point *)
val make_dfa :
('args, 'action) Syntax.entry list ->
('args, 'action) automata_entry list * automata array