1 (**************************************************************************)
5 (* François Pottier, INRIA Rocquencourt *)
6 (* Yann Régis-Gianas, PPS, Université Paris Diderot *)
8 (* Copyright 2005-2008 Institut National de Recherche en Informatique *)
9 (* et en Automatique. All rights reserved. This file is distributed *)
10 (* under the terms of the Q Public License version 1.0, with the change *)
11 (* described in file LICENSE. *)
13 (**************************************************************************)
15 (* These are the operations required of lookahead sets during
16 a closure computation. This signature is exploited by the
17 functor [Item.Closure]. *)
21 (* The type of lookahead sets. *)
24 (* The empty lookahead set. Redundant with the following, but
28 (* A concrete, constant set of terminal symbols. *)
29 val constant
: Grammar.TerminalSet.t
-> t
31 (* [union s1 s2] returns the union of [s1] and [s2]. *)
32 val union
: t
-> t
-> t