Commit e2177ee0 authored by POTTIER Francois's avatar POTTIER Francois

Removed all $Id headers that were still around.

parent 49ded779
(* $Id: action.ml,v 1.10 2006/06/26 09:41:33 regisgia Exp $ *)
open Keyword
type t =
......
(* $Id: action.mli,v 1.8 2006/06/26 09:41:33 regisgia Exp $ *)
(** Semantic action's type. *)
type t
......
(* $Id: concreteSyntax.mli,v 1.3 2005/12/01 16:20:06 regisgia Exp $ *)
type grammar =
{
pg_filename : Syntax.filename;
......
(* $Id: infiniteArray.ml,v 1.6 2007/09/10 21:09:37 fpottier Exp $ *)
(** This module implements infinite arrays, that is, arrays that grow
transparently upon demand. *)
......
(* $Id: infiniteArray.mli,v 1.5 2007/09/10 21:09:37 fpottier Exp $ *)
(** This module implements infinite arrays. **)
type 'a t
......
(* $Id: listMonad.mli,v 1.2 2005/12/01 16:20:06 regisgia Exp $ *)
(** Monad type which represents a list of results. *)
type 'a m = 'a list
......
......@@ -279,3 +279,6 @@ let new_intern capacity =
!c (H.length table)
in
intern, verbose
let new_intern_int capacity =
(* $Id: nonTerminalDefinitionInlining.ml,v 1.17 2006/06/26 09:41:33 regisgia Exp $ *)
open UnparameterizedSyntax
open ListMonad
......
(* $Id: nonTerminalDefinitionInlining.mli,v 1.5 2005/12/01 16:20:06 regisgia Exp $ *)
(** [inline g] traverses the rules of [g] and inlines the non terminal
definitions that are marked with [%inline]. It returns a pair of the transformed
grammar and a flag that tells whether any inlining was actually done. *)
......
(* $Id: parameterizedGrammar.mli,v 1.6 2005/12/01 16:20:06 regisgia Exp $ *)
(* This turns a grammar where nonterminal symbols can be parameterized
into a grammar where nonterminal symbols are not parameterized. The
transformation is a textual expansion process, whose termination is
......
(* $Id: parameters.ml,v 1.12 2005/12/02 16:16:22 regisgia Exp $ *)
(* TEMPORARY clean up and write an .mli file *)
open Syntax
......
(* $Id: partialGrammar.ml,v 1.63 2006/10/22 14:07:57 fpottier Exp $ *)
open Misc
open Syntax
open ConcreteSyntax
......
(* $Id: partialGrammar.mli,v 1.4 2005/12/01 16:20:07 regisgia Exp $ *)
val join_partial_grammars :
ConcreteSyntax.grammar list -> InternalSyntax.grammar
(* $Id: positions.ml,v 1.9 2005/12/01 16:20:07 regisgia Exp $ *)
(* TEMPORARY vérifier que ces fonctions sont utilisées partout et
de façon cohérente; interaction avec [Error]? *)
......
(* $Id: positions.mli,v 1.10 2005/12/01 16:20:07 regisgia Exp $ *)
(* TEMPORARY faire un peu le ménage dans cette interface pléthorique? *)
(** Extension of standard library's positions. *)
......
(* $Id: stretch.mli,v 1.4 2005/12/01 16:20:07 regisgia Exp $ *)
(* A stretch is a fragment of a source file. It holds the file name,
the line number, and the line count (that is, the length) of the
fragment. These are used for generating #line directives when the
......
(* $Id: unionFind.ml,v 1.5 2005/12/01 16:20:07 regisgia Exp $ *)
(** This module implements a simple and efficient union/find algorithm.
See Robert E. Tarjan, ``Efficiency of a Good But Not Linear Set
Union Algorithm'', JACM 22(2), 1975. *)
......
(* $Id: unionFind.mli,v 1.5 2005/12/01 16:20:07 regisgia Exp $ *)
(** This module implements a simple and efficient union/find algorithm.
See Robert E. Tarjan, ``Efficiency of a Good But Not Linear Set
Union Algorithm'', JACM 22(2), 1975. *)
......
Markdown is supported
0% or
You are about to add 0 people to the discussion. Proceed with caution.
Finish editing this message first!
Please register or to comment