Commit c517d2a5 authored by POTTIER Francois's avatar POTTIER Francois

Fix violations of UTF-8 in the sources.

parent 890bd1e5
...@@ -112,7 +112,7 @@ end ...@@ -112,7 +112,7 @@ end
[predecessors] only offers an amortized complexity bound. This is good [predecessors] only offers an amortized complexity bound. This is good
enough for our purposes, and, in practice, is more efficient by a enough for our purposes, and, in practice, is more efficient by a
constant factor. This simplification was suggested by Arthur constant factor. This simplification was suggested by Arthur
Charguéraud. *) Charguéraud. *)
type 'data node = { type 'data node = {
......
...@@ -16,7 +16,7 @@ ...@@ -16,7 +16,7 @@
(* This idea reportedly appears in Aho and Ullman's ``Principles (* This idea reportedly appears in Aho and Ullman's ``Principles
of Compiler Design'' (1977). It is evaluated in Tarjan and Yao's of Compiler Design'' (1977). It is evaluated in Tarjan and Yao's
``Storing a Sparse Table'' (1979) and in Dencker, Dürre, and Heuft's ``Storing a Sparse Table'' (1979) and in Dencker, Dürre, and Heuft's
``Optimization of Parser Tables for Portable Compilers'' (1984). *) ``Optimization of Parser Tables for Portable Compilers'' (1984). *)
(* A compressed table is represented as a pair of arrays. The (* A compressed table is represented as a pair of arrays. The
...@@ -256,4 +256,3 @@ let get (displacement, data) i j = ...@@ -256,4 +256,3 @@ let get (displacement, data) i j =
let getget get_displacement get_data (displacement, data) i j = let getget get_displacement get_data (displacement, data) i j =
let k = decode (get_displacement displacement i) in let k = decode (get_displacement displacement i) in
get_data data (k + j) get_data data (k + j)
...@@ -59,7 +59,7 @@ module type TABLES = sig ...@@ -59,7 +59,7 @@ module type TABLES = sig
val default_reduction: PackedIntArray.t val default_reduction: PackedIntArray.t
(* Menhir follows Dencker, Dürre and Heuft, who point out that, although the (* Menhir follows Dencker, Dürre and Heuft, who point out that, although the
action table is not sparse by nature (i.e., the error entries are action table is not sparse by nature (i.e., the error entries are
significant), it can be made sparse by first factoring out a binary error significant), it can be made sparse by first factoring out a binary error
matrix, then replacing the error entries in the action table with undefined matrix, then replacing the error entries in the action table with undefined
...@@ -135,4 +135,3 @@ module type TABLES = sig ...@@ -135,4 +135,3 @@ module type TABLES = sig
val trace: (string array * string array) option val trace: (string array * string array) option
end end
...@@ -478,7 +478,7 @@ let compatible (k1, toksr1) (k2, toksr2) = ...@@ -478,7 +478,7 @@ let compatible (k1, toksr1) (k2, toksr2) =
but I am not 100% sure, that it does indeed prevent end-of-stream but I am not 100% sure, that it does indeed prevent end-of-stream
conflicts and that it is stable. conflicts and that it is stable.
Thanks to Sébastien Hinderer for reporting the bug caused by the Thanks to Sébastien Hinderer for reporting the bug caused by the
absence of this extra criterion. *) absence of this extra criterion. *)
let eos_compatible (k1, toksr1) (k2, toksr2) = let eos_compatible (k1, toksr1) (k2, toksr2) =
...@@ -529,7 +529,7 @@ let eos_compatible (k1, toksr1) (k2, toksr2) = ...@@ -529,7 +529,7 @@ let eos_compatible (k1, toksr1) (k2, toksr2) =
be error-incompatible. Error-compatibility requires equality of be error-incompatible. Error-compatibility requires equality of
the lookahead sets, restricted to [error]. the lookahead sets, restricted to [error].
Thanks to Didier Rémy for reporting a bug caused by the absence Thanks to Didier Rémy for reporting a bug caused by the absence
of this extra criterion. *) of this extra criterion. *)
let error_compatible (k1, toksr1) (k2, toksr2) = let error_compatible (k1, toksr1) (k2, toksr2) =
...@@ -571,4 +571,3 @@ let restrict toks (k, toksr) = ...@@ -571,4 +571,3 @@ let restrict toks (k, toksr) =
k, Array.map (fun toksri -> k, Array.map (fun toksri ->
TerminalSet.inter toksri toks TerminalSet.inter toksri toks
) toksr ) toksr
...@@ -11,9 +11,6 @@ ...@@ -11,9 +11,6 @@
(* *) (* *)
(******************************************************************************) (******************************************************************************)
(* TEMPORARY vérifier que ces fonctions sont utilisées partout et
de façon cohérente; interaction avec [Error]? *)
open Lexing open Lexing
type t = type t =
...@@ -165,4 +162,3 @@ let print (pos : Lexing.position) = ...@@ -165,4 +162,3 @@ let print (pos : Lexing.position) =
pos.pos_lnum pos.pos_lnum
pos.pos_bol pos.pos_bol
pos.pos_cnum pos.pos_cnum
...@@ -11,7 +11,7 @@ ...@@ -11,7 +11,7 @@
(* *) (* *)
(******************************************************************************) (******************************************************************************)
(* TEMPORARY faire un peu le ménage dans cette interface pléthorique? *) (* TEMPORARY clean up this over-complicated API? *)
(** Extension of standard library's positions. *) (** Extension of standard library's positions. *)
......
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