├── .gitignore ├── src ├── dune ├── genlex.mli ├── stream.mli ├── stream.ml └── genlex.ml ├── CHANGES.md ├── README.md ├── dune-project ├── camlp-streams.opam └── LICENSE /.gitignore: -------------------------------------------------------------------------------- 1 | _build 2 | camlpstreams.opam 3 | *~ 4 | -------------------------------------------------------------------------------- /src/dune: -------------------------------------------------------------------------------- 1 | (library 2 | (name camlp_streams) 3 | (public_name camlp-streams) 4 | (wrapped false) 5 | (flags :standard -w -9)) 6 | -------------------------------------------------------------------------------- /CHANGES.md: -------------------------------------------------------------------------------- 1 | # dev 2 | 3 | - Update licensing metadata. 4 | - Update dune files to 2.7 to autogenerate opam files correctly (#2) 5 | - Lower OCaml version to 4.02.3 6 | 7 | # Release 5.0 (2021-06-29) 8 | 9 | - Initial import from OCaml 4.14 10 | - Packaging improvements (#1) 11 | - Initial release 12 | -------------------------------------------------------------------------------- /README.md: -------------------------------------------------------------------------------- 1 | # The Stream and Genlex libraries for use with Camlp4 and Camlp5 2 | 3 | The `camlp-streams` package provides two library modules: 4 | - `Stream`: imperative streams, with in-place update and memoization of the latest element produced. 5 | - `Genlex`: a small parameterized lexical analyzer producing streams of tokens from streams of characters. 6 | 7 | The two modules are designed for use with [Camlp4](https://github.com/camlp4/camlp4/) and [Camlp5](https://github.com/camlp5/camlp5): 8 | - The stream patterns and stream expressions of Camlp4/Camlp5 consume and produce data of type `'a Stream.t`. 9 | - The `Genlex` tokenizer can be used as a simple lexical analyzer for Camlp4/Camlp5-generated parsers. 10 | 11 | The `Stream` module can also be used by hand-written recursive-descent parsers, but is not very convenient for this purpose. 12 | 13 | The `Stream` and `Genlex` modules have been part of the OCaml standard library for a long time, and have been distributed as part of the core OCaml system. They will be removed from the OCaml standard library at some future point, but will be maintained and distributed separately in this `camlp-streams` package. 14 | -------------------------------------------------------------------------------- /dune-project: -------------------------------------------------------------------------------- 1 | (lang dune 2.7) 2 | (generate_opam_files true) 3 | (formatting disabled) 4 | 5 | (name camlp-streams) 6 | (source (github ocaml/camlp-streams)) 7 | (authors "Daniel de Rauglaudre" "Xavier Leroy") 8 | (maintainers 9 | "Florian Angeletti " 10 | "Xavier Leroy ") 11 | 12 | (package 13 | (name camlp-streams) 14 | (synopsis "The Stream and Genlex libraries for use with Camlp4 and Camlp5") 15 | (description " 16 | This package provides two library modules: 17 | - Stream: imperative streams, with in-place update and memoization 18 | of the latest element produced. 19 | - Genlex: a small parameterized lexical analyzer producing streams 20 | of tokens from streams of characters. 21 | 22 | The two modules are designed for use with Camlp4 and Camlp5: 23 | - The stream patterns and stream expressions of Camlp4/Camlp5 consume 24 | and produce data of type 'a Stream.t. 25 | - The Genlex tokenizer can be used as a simple lexical analyzer for 26 | Camlp4/Camlp5-generated parsers. 27 | 28 | The Stream module can also be used by hand-written recursive-descent 29 | parsers, but is not very convenient for this purpose. 30 | 31 | The Stream and Genlex modules have been part of the OCaml standard library 32 | for a long time, and have been distributed as part of the core OCaml system. 33 | They will be removed from the OCaml standard library at some future point, 34 | but will be maintained and distributed separately in this camlpstreams package. 35 | ") 36 | 37 | (depends 38 | (ocaml (>= 4.02.3))) 39 | ) 40 | -------------------------------------------------------------------------------- /camlp-streams.opam: -------------------------------------------------------------------------------- 1 | # This file is generated by dune, edit dune-project instead 2 | opam-version: "2.0" 3 | synopsis: "The Stream and Genlex libraries for use with Camlp4 and Camlp5" 4 | description: """ 5 | 6 | This package provides two library modules: 7 | - Stream: imperative streams, with in-place update and memoization 8 | of the latest element produced. 9 | - Genlex: a small parameterized lexical analyzer producing streams 10 | of tokens from streams of characters. 11 | 12 | The two modules are designed for use with Camlp4 and Camlp5: 13 | - The stream patterns and stream expressions of Camlp4/Camlp5 consume 14 | and produce data of type 'a Stream.t. 15 | - The Genlex tokenizer can be used as a simple lexical analyzer for 16 | Camlp4/Camlp5-generated parsers. 17 | 18 | The Stream module can also be used by hand-written recursive-descent 19 | parsers, but is not very convenient for this purpose. 20 | 21 | The Stream and Genlex modules have been part of the OCaml standard library 22 | for a long time, and have been distributed as part of the core OCaml system. 23 | They will be removed from the OCaml standard library at some future point, 24 | but will be maintained and distributed separately in this camlpstreams package. 25 | """ 26 | maintainer: [ 27 | "Florian Angeletti " 28 | "Xavier Leroy " 29 | ] 30 | authors: ["Daniel de Rauglaudre" "Xavier Leroy"] 31 | homepage: "https://github.com/ocaml/camlp-streams" 32 | bug-reports: "https://github.com/ocaml/camlp-streams/issues" 33 | depends: [ 34 | "dune" {>= "2.7"} 35 | "ocaml" {>= "4.02.3"} 36 | "odoc" {with-doc} 37 | ] 38 | build: [ 39 | ["dune" "subst"] {dev} 40 | [ 41 | "dune" 42 | "build" 43 | "-p" 44 | name 45 | "-j" 46 | jobs 47 | "@install" 48 | "@runtest" {with-test} 49 | "@doc" {with-doc} 50 | ] 51 | ] 52 | dev-repo: "git+https://github.com/ocaml/camlp-streams.git" 53 | -------------------------------------------------------------------------------- /src/genlex.mli: -------------------------------------------------------------------------------- 1 | (**************************************************************************) 2 | (* *) 3 | (* OCaml *) 4 | (* *) 5 | (* Xavier Leroy, projet Cristal, INRIA Rocquencourt *) 6 | (* *) 7 | (* Copyright 1996 Institut National de Recherche en Informatique et *) 8 | (* en Automatique. *) 9 | (* *) 10 | (* All rights reserved. This file is distributed under the terms of *) 11 | (* the GNU Lesser General Public License version 2.1, with the *) 12 | (* special exception on linking described in the file LICENSE. *) 13 | (* *) 14 | (**************************************************************************) 15 | 16 | (** A generic lexical analyzer. 17 | 18 | 19 | This module implements a simple 'standard' lexical analyzer, presented 20 | as a function from character streams to token streams. It implements 21 | roughly the lexical conventions of OCaml, but is parameterized by the 22 | set of keywords of your language. 23 | 24 | 25 | Example: a lexer suitable for a desk calculator is obtained by 26 | {[ let lexer = make_lexer ["+"; "-"; "*"; "/"; "let"; "="; "("; ")"]]} 27 | 28 | The associated parser would be a function from [token stream] 29 | to, for instance, [int], and would have rules such as: 30 | 31 | {[ 32 | let rec parse_expr = parser 33 | | [< n1 = parse_atom; n2 = parse_remainder n1 >] -> n2 34 | and parse_atom = parser 35 | | [< 'Int n >] -> n 36 | | [< 'Kwd "("; n = parse_expr; 'Kwd ")" >] -> n 37 | and parse_remainder n1 = parser 38 | | [< 'Kwd "+"; n2 = parse_expr >] -> n1 + n2 39 | | [< >] -> n1 40 | ]} 41 | 42 | One should notice that the use of the [parser] keyword and associated 43 | notation for streams are only available through camlp4 extensions. This 44 | means that one has to preprocess its sources {i e. g.} by using the 45 | ["-pp"] command-line switch of the compilers. 46 | *) 47 | 48 | (** The type of tokens. The lexical classes are: [Int] and [Float] 49 | for integer and floating-point numbers; [String] for 50 | string literals, enclosed in double quotes; [Char] for 51 | character literals, enclosed in single quotes; [Ident] for 52 | identifiers (either sequences of letters, digits, underscores 53 | and quotes, or sequences of 'operator characters' such as 54 | [+], [*], etc); and [Kwd] for keywords (either identifiers or 55 | single 'special characters' such as [(], [}], etc). *) 56 | type token = 57 | Kwd of string 58 | | Ident of string 59 | | Int of int 60 | | Float of float 61 | | String of string 62 | | Char of char 63 | 64 | val make_lexer : string list -> char Stream.t -> token Stream.t 65 | (** Construct the lexer function. The first argument is the list of 66 | keywords. An identifier [s] is returned as [Kwd s] if [s] 67 | belongs to this list, and as [Ident s] otherwise. 68 | A special character [s] is returned as [Kwd s] if [s] 69 | belongs to this list, and cause a lexical error (exception 70 | {!Stream.Error} with the offending lexeme as its parameter) otherwise. 71 | Blanks and newlines are skipped. Comments delimited by [(*] and [*)] 72 | are skipped as well, and can be nested. A {!Stream.Failure} exception 73 | is raised if end of stream is unexpectedly reached.*) 74 | -------------------------------------------------------------------------------- /src/stream.mli: -------------------------------------------------------------------------------- 1 | (**************************************************************************) 2 | (* *) 3 | (* OCaml *) 4 | (* *) 5 | (* Daniel de Rauglaudre, projet Cristal, INRIA Rocquencourt *) 6 | (* *) 7 | (* Copyright 1997 Institut National de Recherche en Informatique et *) 8 | (* en Automatique. *) 9 | (* *) 10 | (* All rights reserved. This file is distributed under the terms of *) 11 | (* the GNU Lesser General Public License version 2.1, with the *) 12 | (* special exception on linking described in the file LICENSE. *) 13 | (* *) 14 | (**************************************************************************) 15 | 16 | (** Streams and parsers. *) 17 | 18 | type 'a t 19 | (** The type of streams holding values of type ['a]. *) 20 | 21 | exception Failure 22 | (** Raised by parsers when none of the first components of the stream 23 | patterns is accepted. *) 24 | 25 | exception Error of string 26 | (** Raised by parsers when the first component of a stream pattern is 27 | accepted, but one of the following components is rejected. *) 28 | 29 | 30 | (** {1 Stream builders} *) 31 | 32 | val from : (int -> 'a option) -> 'a t 33 | (** [Stream.from f] returns a stream built from the function [f]. 34 | To create a new stream element, the function [f] is called with 35 | the current stream count. The user function [f] must return either 36 | [Some ] for a value or [None] to specify the end of the 37 | stream. 38 | 39 | Do note that the indices passed to [f] may not start at [0] in the 40 | general case. For example, [[< '0; '1; Stream.from f >]] would call 41 | [f] the first time with count [2]. 42 | *) 43 | 44 | val of_list : 'a list -> 'a t 45 | (** Return the stream holding the elements of the list in the same 46 | order. *) 47 | 48 | val of_string : string -> char t 49 | (** Return the stream of the characters of the string parameter. *) 50 | 51 | val of_bytes : bytes -> char t 52 | (** Return the stream of the characters of the bytes parameter. 53 | @since 4.02.0 *) 54 | 55 | val of_channel : in_channel -> char t 56 | (** Return the stream of the characters read from the input channel. *) 57 | 58 | 59 | (** {1 Stream iterator} *) 60 | 61 | val iter : ('a -> unit) -> 'a t -> unit 62 | (** [Stream.iter f s] scans the whole stream s, applying function [f] 63 | in turn to each stream element encountered. *) 64 | 65 | 66 | (** {1 Predefined parsers} *) 67 | 68 | val next : 'a t -> 'a 69 | (** Return the first element of the stream and remove it from the 70 | stream. 71 | @raise Stream.Failure if the stream is empty. *) 72 | 73 | val empty : 'a t -> unit 74 | (** Return [()] if the stream is empty, else raise {!Stream.Failure}. *) 75 | 76 | 77 | (** {1 Useful functions} *) 78 | 79 | val peek : 'a t -> 'a option 80 | (** Return [Some] of "the first element" of the stream, or [None] if 81 | the stream is empty. *) 82 | 83 | val junk : 'a t -> unit 84 | (** Remove the first element of the stream, possibly unfreezing 85 | it before. *) 86 | 87 | val count : 'a t -> int 88 | (** Return the current count of the stream elements, i.e. the number 89 | of the stream elements discarded. *) 90 | 91 | val npeek : int -> 'a t -> 'a list 92 | (** [npeek n] returns the list of the [n] first elements of 93 | the stream, or all its remaining elements if less than [n] 94 | elements are available. *) 95 | 96 | (**/**) 97 | 98 | (* The following is for system use only. Do not call directly. *) 99 | 100 | val iapp : 'a t -> 'a t -> 'a t 101 | val icons : 'a -> 'a t -> 'a t 102 | val ising : 'a -> 'a t 103 | 104 | val lapp : (unit -> 'a t) -> 'a t -> 'a t 105 | val lcons : (unit -> 'a) -> 'a t -> 'a t 106 | val lsing : (unit -> 'a) -> 'a t 107 | 108 | val sempty : 'a t 109 | val slazy : (unit -> 'a t) -> 'a t 110 | 111 | val dump : ('a -> unit) -> 'a t -> unit 112 | -------------------------------------------------------------------------------- /src/stream.ml: -------------------------------------------------------------------------------- 1 | (**************************************************************************) 2 | (* *) 3 | (* OCaml *) 4 | (* *) 5 | (* Daniel de Rauglaudre, projet Cristal, INRIA Rocquencourt *) 6 | (* *) 7 | (* Copyright 1997 Institut National de Recherche en Informatique et *) 8 | (* en Automatique. *) 9 | (* *) 10 | (* All rights reserved. This file is distributed under the terms of *) 11 | (* the GNU Lesser General Public License version 2.1, with the *) 12 | (* special exception on linking described in the file LICENSE. *) 13 | (* *) 14 | (**************************************************************************) 15 | 16 | type 'a t = 'a cell option 17 | and 'a cell = { mutable count : int; mutable data : 'a data } 18 | and 'a data = 19 | Sempty 20 | | Scons of 'a * 'a data 21 | | Sapp of 'a data * 'a data 22 | | Slazy of 'a data Lazy.t 23 | | Sgen of 'a gen 24 | | Sbuffio : buffio -> char data 25 | and 'a gen = { mutable curr : 'a option option; func : int -> 'a option } 26 | and buffio = 27 | { ic : in_channel; buff : bytes; mutable len : int; mutable ind : int } 28 | 29 | exception Failure 30 | exception Error of string 31 | 32 | let count = function 33 | | None -> 0 34 | | Some { count } -> count 35 | let data = function 36 | | None -> Sempty 37 | | Some { data } -> data 38 | 39 | let fill_buff b = 40 | b.len <- input b.ic b.buff 0 (Bytes.length b.buff); b.ind <- 0 41 | 42 | 43 | let rec get_data : type v. int -> v data -> v data = fun count d -> match d with 44 | (* Returns either Sempty or Scons(a, _) even when d is a generator 45 | or a buffer. In those cases, the item a is seen as extracted from 46 | the generator/buffer. 47 | The count parameter is used for calling `Sgen-functions'. *) 48 | Sempty | Scons (_, _) -> d 49 | | Sapp (d1, d2) -> 50 | begin match get_data count d1 with 51 | Scons (a, d11) -> Scons (a, Sapp (d11, d2)) 52 | | Sempty -> get_data count d2 53 | | _ -> assert false 54 | end 55 | | Sgen {curr = Some None} -> Sempty 56 | | Sgen ({curr = Some(Some a)} as g) -> 57 | g.curr <- None; Scons(a, d) 58 | | Sgen g -> 59 | begin match g.func count with 60 | None -> g.curr <- Some(None); Sempty 61 | | Some a -> Scons(a, d) 62 | (* Warning: anyone using g thinks that an item has been read *) 63 | end 64 | | Sbuffio b -> 65 | if b.ind >= b.len then fill_buff b; 66 | if b.len == 0 then Sempty else 67 | let r = Bytes.unsafe_get b.buff b.ind in 68 | (* Warning: anyone using g thinks that an item has been read *) 69 | b.ind <- succ b.ind; Scons(r, d) 70 | | Slazy f -> get_data count (Lazy.force f) 71 | 72 | 73 | let rec peek_data : type v. v cell -> v option = fun s -> 74 | (* consult the first item of s *) 75 | match s.data with 76 | Sempty -> None 77 | | Scons (a, _) -> Some a 78 | | Sapp (_, _) -> 79 | begin match get_data s.count s.data with 80 | Scons(a, _) as d -> s.data <- d; Some a 81 | | Sempty -> None 82 | | _ -> assert false 83 | end 84 | | Slazy f -> s.data <- (Lazy.force f); peek_data s 85 | | Sgen {curr = Some a} -> a 86 | | Sgen g -> let x = g.func s.count in g.curr <- Some x; x 87 | | Sbuffio b -> 88 | if b.ind >= b.len then fill_buff b; 89 | if b.len == 0 then begin s.data <- Sempty; None end 90 | else Some (Bytes.unsafe_get b.buff b.ind) 91 | 92 | 93 | let peek = function 94 | | None -> None 95 | | Some s -> peek_data s 96 | 97 | 98 | let rec junk_data : type v. v cell -> unit = fun s -> 99 | match s.data with 100 | Scons (_, d) -> s.count <- (succ s.count); s.data <- d 101 | | Sgen ({curr = Some _} as g) -> s.count <- (succ s.count); g.curr <- None 102 | | Sbuffio b -> 103 | if b.ind >= b.len then fill_buff b; 104 | if b.len == 0 then s.data <- Sempty 105 | else (s.count <- (succ s.count); b.ind <- succ b.ind) 106 | | _ -> 107 | match peek_data s with 108 | None -> () 109 | | Some _ -> junk_data s 110 | 111 | 112 | let junk = function 113 | | None -> () 114 | | Some data -> junk_data data 115 | 116 | let rec nget_data n s = 117 | if n <= 0 then [], s.data, 0 118 | else 119 | match peek_data s with 120 | Some a -> 121 | junk_data s; 122 | let (al, d, k) = nget_data (pred n) s in a :: al, Scons (a, d), succ k 123 | | None -> [], s.data, 0 124 | 125 | 126 | let npeek_data n s = 127 | let (al, d, len) = nget_data n s in 128 | s.count <- (s.count - len); 129 | s.data <- d; 130 | al 131 | 132 | 133 | let npeek n = function 134 | | None -> [] 135 | | Some d -> npeek_data n d 136 | 137 | let next s = 138 | match peek s with 139 | Some a -> junk s; a 140 | | None -> raise Failure 141 | 142 | 143 | let empty s = 144 | match peek s with 145 | Some _ -> raise Failure 146 | | None -> () 147 | 148 | 149 | let iter f strm = 150 | let rec do_rec () = 151 | match peek strm with 152 | Some a -> junk strm; ignore(f a); do_rec () 153 | | None -> () 154 | in 155 | do_rec () 156 | 157 | 158 | (* Stream building functions *) 159 | 160 | let from f = Some {count = 0; data = Sgen {curr = None; func = f}} 161 | 162 | let of_list l = 163 | Some {count = 0; data = List.fold_right (fun x l -> Scons (x, l)) l Sempty} 164 | 165 | 166 | let of_string s = 167 | let count = ref 0 in 168 | from (fun _ -> 169 | (* We cannot use the index passed by the [from] function directly 170 | because it returns the current stream count, with absolutely no 171 | guarantee that it will start from 0. For example, in the case 172 | of [Stream.icons 'c' (Stream.from_string "ab")], the first 173 | access to the string will be made with count [1] already. 174 | *) 175 | let c = !count in 176 | if c < String.length s 177 | then (incr count; Some s.[c]) 178 | else None) 179 | 180 | 181 | let of_bytes s = 182 | let count = ref 0 in 183 | from (fun _ -> 184 | let c = !count in 185 | if c < Bytes.length s 186 | then (incr count; Some (Bytes.get s c)) 187 | else None) 188 | 189 | 190 | let of_channel ic = 191 | Some {count = 0; 192 | data = Sbuffio {ic = ic; buff = Bytes.create 4096; len = 0; ind = 0}} 193 | 194 | 195 | (* Stream expressions builders *) 196 | 197 | let iapp i s = Some {count = 0; data = Sapp (data i, data s)} 198 | let icons i s = Some {count = 0; data = Scons (i, data s)} 199 | let ising i = Some {count = 0; data = Scons (i, Sempty)} 200 | 201 | let lapp f s = 202 | Some {count = 0; data = Slazy (lazy(Sapp (data (f ()), data s)))} 203 | 204 | let lcons f s = Some {count = 0; data = Slazy (lazy(Scons (f (), data s)))} 205 | let lsing f = Some {count = 0; data = Slazy (lazy(Scons (f (), Sempty)))} 206 | 207 | let sempty = None 208 | let slazy f = Some {count = 0; data = Slazy (lazy(data (f ())))} 209 | 210 | (* For debugging use *) 211 | 212 | let rec dump : type v. (v -> unit) -> v t -> unit = fun f s -> 213 | print_string "{count = "; 214 | print_int (count s); 215 | print_string "; data = "; 216 | dump_data f (data s); 217 | print_string "}"; 218 | print_newline () 219 | and dump_data : type v. (v -> unit) -> v data -> unit = fun f -> 220 | function 221 | Sempty -> print_string "Sempty" 222 | | Scons (a, d) -> 223 | print_string "Scons ("; 224 | f a; 225 | print_string ", "; 226 | dump_data f d; 227 | print_string ")" 228 | | Sapp (d1, d2) -> 229 | print_string "Sapp ("; 230 | dump_data f d1; 231 | print_string ", "; 232 | dump_data f d2; 233 | print_string ")" 234 | | Slazy _ -> print_string "Slazy" 235 | | Sgen _ -> print_string "Sgen" 236 | | Sbuffio _ -> print_string "Sbuffio" 237 | -------------------------------------------------------------------------------- /src/genlex.ml: -------------------------------------------------------------------------------- 1 | (**************************************************************************) 2 | (* *) 3 | (* OCaml *) 4 | (* *) 5 | (* Xavier Leroy, projet Cristal, INRIA Rocquencourt *) 6 | (* *) 7 | (* Copyright 1996 Institut National de Recherche en Informatique et *) 8 | (* en Automatique. *) 9 | (* *) 10 | (* All rights reserved. This file is distributed under the terms of *) 11 | (* the GNU Lesser General Public License version 2.1, with the *) 12 | (* special exception on linking described in the file LICENSE. *) 13 | (* *) 14 | (**************************************************************************) 15 | 16 | type token = 17 | Kwd of string 18 | | Ident of string 19 | | Int of int 20 | | Float of float 21 | | String of string 22 | | Char of char 23 | 24 | (* The string buffering machinery *) 25 | 26 | let initial_buffer = Bytes.create 32 27 | 28 | let buffer = ref initial_buffer 29 | let bufpos = ref 0 30 | 31 | let reset_buffer () = buffer := initial_buffer; bufpos := 0 32 | 33 | let store c = 34 | if !bufpos >= Bytes.length !buffer then begin 35 | let newbuffer = Bytes.create (2 * !bufpos) in 36 | Bytes.blit !buffer 0 newbuffer 0 !bufpos; 37 | buffer := newbuffer 38 | end; 39 | Bytes.set !buffer !bufpos c; 40 | incr bufpos 41 | 42 | let get_string () = 43 | let s = Bytes.sub_string !buffer 0 !bufpos in buffer := initial_buffer; s 44 | 45 | (* The lexer *) 46 | 47 | let make_lexer keywords = 48 | let kwd_table = Hashtbl.create 17 in 49 | List.iter (fun s -> Hashtbl.add kwd_table s (Kwd s)) keywords; 50 | let ident_or_keyword id = 51 | try Hashtbl.find kwd_table id with 52 | Not_found -> Ident id 53 | and keyword_or_error c = 54 | let s = String.make 1 c in 55 | try Hashtbl.find kwd_table s with 56 | Not_found -> raise (Stream.Error ("Illegal character " ^ s)) 57 | in 58 | let rec next_token (strm__ : _ Stream.t) = 59 | match Stream.peek strm__ with 60 | Some (' ' | '\010' | '\013' | '\009' | '\026' | '\012') -> 61 | Stream.junk strm__; next_token strm__ 62 | | Some ('A'..'Z' | 'a'..'z' | '_' | '\192'..'\255' as c) -> 63 | Stream.junk strm__; 64 | let s = strm__ in reset_buffer (); store c; ident s 65 | | Some 66 | ('!' | '%' | '&' | '$' | '#' | '+' | '/' | ':' | '<' | '=' | '>' | 67 | '?' | '@' | '\\' | '~' | '^' | '|' | '*' as c) -> 68 | Stream.junk strm__; 69 | let s = strm__ in reset_buffer (); store c; ident2 s 70 | | Some ('0'..'9' as c) -> 71 | Stream.junk strm__; 72 | let s = strm__ in reset_buffer (); store c; number s 73 | | Some '\'' -> 74 | Stream.junk strm__; 75 | let c = 76 | try char strm__ with 77 | Stream.Failure -> raise (Stream.Error "") 78 | in 79 | begin match Stream.peek strm__ with 80 | Some '\'' -> Stream.junk strm__; Some (Char c) 81 | | _ -> raise (Stream.Error "") 82 | end 83 | | Some '\"' -> 84 | Stream.junk strm__; 85 | let s = strm__ in reset_buffer (); Some (String (string s)) 86 | | Some '-' -> Stream.junk strm__; neg_number strm__ 87 | | Some '(' -> Stream.junk strm__; maybe_comment strm__ 88 | | Some c -> Stream.junk strm__; Some (keyword_or_error c) 89 | | _ -> None 90 | and ident (strm__ : _ Stream.t) = 91 | match Stream.peek strm__ with 92 | Some 93 | ('A'..'Z' | 'a'..'z' | '\192'..'\255' | '0'..'9' | '_' | '\'' as c) -> 94 | Stream.junk strm__; let s = strm__ in store c; ident s 95 | | _ -> Some (ident_or_keyword (get_string ())) 96 | and ident2 (strm__ : _ Stream.t) = 97 | match Stream.peek strm__ with 98 | Some 99 | ('!' | '%' | '&' | '$' | '#' | '+' | '-' | '/' | ':' | '<' | '=' | 100 | '>' | '?' | '@' | '\\' | '~' | '^' | '|' | '*' as c) -> 101 | Stream.junk strm__; let s = strm__ in store c; ident2 s 102 | | _ -> Some (ident_or_keyword (get_string ())) 103 | and neg_number (strm__ : _ Stream.t) = 104 | match Stream.peek strm__ with 105 | Some ('0'..'9' as c) -> 106 | Stream.junk strm__; 107 | let s = strm__ in reset_buffer (); store '-'; store c; number s 108 | | _ -> let s = strm__ in reset_buffer (); store '-'; ident2 s 109 | and number (strm__ : _ Stream.t) = 110 | match Stream.peek strm__ with 111 | Some ('0'..'9' as c) -> 112 | Stream.junk strm__; let s = strm__ in store c; number s 113 | | Some '.' -> 114 | Stream.junk strm__; let s = strm__ in store '.'; decimal_part s 115 | | Some ('e' | 'E') -> 116 | Stream.junk strm__; let s = strm__ in store 'E'; exponent_part s 117 | | _ -> Some (Int (int_of_string (get_string ()))) 118 | and decimal_part (strm__ : _ Stream.t) = 119 | match Stream.peek strm__ with 120 | Some ('0'..'9' as c) -> 121 | Stream.junk strm__; let s = strm__ in store c; decimal_part s 122 | | Some ('e' | 'E') -> 123 | Stream.junk strm__; let s = strm__ in store 'E'; exponent_part s 124 | | _ -> Some (Float (float_of_string (get_string ()))) 125 | and exponent_part (strm__ : _ Stream.t) = 126 | match Stream.peek strm__ with 127 | Some ('+' | '-' as c) -> 128 | Stream.junk strm__; let s = strm__ in store c; end_exponent_part s 129 | | _ -> end_exponent_part strm__ 130 | and end_exponent_part (strm__ : _ Stream.t) = 131 | match Stream.peek strm__ with 132 | Some ('0'..'9' as c) -> 133 | Stream.junk strm__; let s = strm__ in store c; end_exponent_part s 134 | | _ -> Some (Float (float_of_string (get_string ()))) 135 | and string (strm__ : _ Stream.t) = 136 | match Stream.peek strm__ with 137 | Some '\"' -> Stream.junk strm__; get_string () 138 | | Some '\\' -> 139 | Stream.junk strm__; 140 | let c = 141 | try escape strm__ with 142 | Stream.Failure -> raise (Stream.Error "") 143 | in 144 | let s = strm__ in store c; string s 145 | | Some c -> Stream.junk strm__; let s = strm__ in store c; string s 146 | | _ -> raise Stream.Failure 147 | and char (strm__ : _ Stream.t) = 148 | match Stream.peek strm__ with 149 | Some '\\' -> 150 | Stream.junk strm__; 151 | begin try escape strm__ with 152 | Stream.Failure -> raise (Stream.Error "") 153 | end 154 | | Some c -> Stream.junk strm__; c 155 | | _ -> raise Stream.Failure 156 | and escape (strm__ : _ Stream.t) = 157 | match Stream.peek strm__ with 158 | Some 'n' -> Stream.junk strm__; '\n' 159 | | Some 'r' -> Stream.junk strm__; '\r' 160 | | Some 't' -> Stream.junk strm__; '\t' 161 | | Some ('0'..'9' as c1) -> 162 | Stream.junk strm__; 163 | begin match Stream.peek strm__ with 164 | Some ('0'..'9' as c2) -> 165 | Stream.junk strm__; 166 | begin match Stream.peek strm__ with 167 | Some ('0'..'9' as c3) -> 168 | Stream.junk strm__; 169 | Char.chr 170 | ((Char.code c1 - 48) * 100 + (Char.code c2 - 48) * 10 + 171 | (Char.code c3 - 48)) 172 | | _ -> raise (Stream.Error "") 173 | end 174 | | _ -> raise (Stream.Error "") 175 | end 176 | | Some c -> Stream.junk strm__; c 177 | | _ -> raise Stream.Failure 178 | and maybe_comment (strm__ : _ Stream.t) = 179 | match Stream.peek strm__ with 180 | Some '*' -> 181 | Stream.junk strm__; let s = strm__ in comment s; next_token s 182 | | _ -> Some (keyword_or_error '(') 183 | and comment (strm__ : _ Stream.t) = 184 | match Stream.peek strm__ with 185 | Some '(' -> Stream.junk strm__; maybe_nested_comment strm__ 186 | | Some '*' -> Stream.junk strm__; maybe_end_comment strm__ 187 | | Some _ -> Stream.junk strm__; comment strm__ 188 | | _ -> raise Stream.Failure 189 | and maybe_nested_comment (strm__ : _ Stream.t) = 190 | match Stream.peek strm__ with 191 | Some '*' -> Stream.junk strm__; let s = strm__ in comment s; comment s 192 | | Some _ -> Stream.junk strm__; comment strm__ 193 | | _ -> raise Stream.Failure 194 | and maybe_end_comment (strm__ : _ Stream.t) = 195 | match Stream.peek strm__ with 196 | Some ')' -> Stream.junk strm__; () 197 | | Some '*' -> Stream.junk strm__; maybe_end_comment strm__ 198 | | Some _ -> Stream.junk strm__; comment strm__ 199 | | _ -> raise Stream.Failure 200 | in 201 | fun input -> Stream.from (fun _count -> next_token input) 202 | -------------------------------------------------------------------------------- /LICENSE: -------------------------------------------------------------------------------- 1 | The Camlp-streams library is copyright Institut National de Recherche 2 | en Informatique et en Automatique (INRIA) and distributed under the 3 | terms of the GNU Lesser General Public License (LGPL) version 2.1 4 | (included below). 5 | 6 | As a special exception to the GNU Lesser General Public License, you 7 | may link, statically or dynamically, a "work that uses the 8 | Camlp-streams library" with a publicly distributed version of the 9 | Camlp-streams library to produce an executable file containing 10 | portions of the Camlp-streams library, and distribute that executable 11 | file under terms of your choice, without any of the additional 12 | requirements listed in clause 6 of the GNU Lesser General Public 13 | License. By "a publicly distributed version of the Camlp-streams 14 | library", we mean either the unmodified Camlp-streams library 15 | available from https://github/com/ocaml/camlp-streams, or a modified 16 | version of the Camlp-streams library that is distributed under the 17 | conditions defined in clause 2 of the GNU Lesser General Public 18 | License. This exception does not however invalidate any other reasons 19 | why the executable file might be covered by the GNU Lesser General 20 | Public License. 21 | 22 | ---------------------------------------------------------------------- 23 | 24 | GNU LESSER GENERAL PUBLIC LICENSE 25 | 26 | Version 2.1, February 1999 27 | 28 | Copyright (C) 1991, 1999 Free Software Foundation, Inc. 29 | 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA 30 | Everyone is permitted to copy and distribute verbatim copies 31 | of this license document, but changing it is not allowed. 32 | 33 | [This is the first released version of the Lesser GPL. It also counts 34 | as the successor of the GNU Library Public License, version 2, hence 35 | the version number 2.1.] 36 | 37 | Preamble 38 | 39 | The licenses for most software are designed to take away your freedom to share and change it. By contrast, the GNU General Public Licenses are intended to guarantee your freedom to share and change free software--to make sure the software is free for all its users. 40 | 41 | This license, the Lesser General Public License, applies to some specially designated software packages--typically libraries--of the Free Software Foundation and other authors who decide to use it. You can use it too, but we suggest you first think carefully about whether this license or the ordinary General Public License is the better strategy to use in any particular case, based on the explanations below. 42 | 43 | When we speak of free software, we are referring to freedom of use, not price. Our General Public Licenses are designed to make sure that you have the freedom to distribute copies of free software (and charge for this service if you wish); that you receive source code or can get it if you want it; that you can change the software and use pieces of it in new free programs; and that you are informed that you can do these things. 44 | 45 | To protect your rights, we need to make restrictions that forbid distributors to deny you these rights or to ask you to surrender these rights. These restrictions translate to certain responsibilities for you if you distribute copies of the library or if you modify it. 46 | 47 | For example, if you distribute copies of the library, whether gratis or for a fee, you must give the recipients all the rights that we gave you. You must make sure that they, too, receive or can get the source code. If you link other code with the library, you must provide complete object files to the recipients, so that they can relink them with the library after making changes to the library and recompiling it. And you must show them these terms so they know their rights. 48 | 49 | We protect your rights with a two-step method: (1) we copyright the library, and (2) we offer you this license, which gives you legal permission to copy, distribute and/or modify the library. 50 | 51 | To protect each distributor, we want to make it very clear that there is no warranty for the free library. Also, if the library is modified by someone else and passed on, the recipients should know that what they have is not the original version, so that the original author's reputation will not be affected by problems that might be introduced by others. 52 | 53 | Finally, software patents pose a constant threat to the existence of any free program. We wish to make sure that a company cannot effectively restrict the users of a free program by obtaining a restrictive license from a patent holder. Therefore, we insist that any patent license obtained for a version of the library must be consistent with the full freedom of use specified in this license. 54 | 55 | Most GNU software, including some libraries, is covered by the ordinary GNU General Public License. This license, the GNU Lesser General Public License, applies to certain designated libraries, and is quite different from the ordinary General Public License. We use this license for certain libraries in order to permit linking those libraries into non-free programs. 56 | 57 | When a program is linked with a library, whether statically or using a shared library, the combination of the two is legally speaking a combined work, a derivative of the original library. The ordinary General Public License therefore permits such linking only if the entire combination fits its criteria of freedom. The Lesser General Public License permits more lax criteria for linking other code with the library. 58 | 59 | We call this license the "Lesser" General Public License because it does Less to protect the user's freedom than the ordinary General Public License. It also provides other free software developers Less of an advantage over competing non-free programs. These disadvantages are the reason we use the ordinary General Public License for many libraries. However, the Lesser license provides advantages in certain special circumstances. 60 | 61 | For example, on rare occasions, there may be a special need to encourage the widest possible use of a certain library, so that it becomes a de-facto standard. To achieve this, non-free programs must be allowed to use the library. A more frequent case is that a free library does the same job as widely used non-free libraries. In this case, there is little to gain by limiting the free library to free software only, so we use the Lesser General Public License. 62 | 63 | In other cases, permission to use a particular library in non-free programs enables a greater number of people to use a large body of free software. For example, permission to use the GNU C Library in non-free programs enables many more people to use the whole GNU operating system, as well as its variant, the GNU/Linux operating system. 64 | 65 | Although the Lesser General Public License is Less protective of the users' freedom, it does ensure that the user of a program that is linked with the Library has the freedom and the wherewithal to run that program using a modified version of the Library. 66 | 67 | The precise terms and conditions for copying, distribution and modification follow. Pay close attention to the difference between a "work based on the library" and a "work that uses the library". The former contains code derived from the library, whereas the latter must be combined with the library in order to run. 68 | 69 | TERMS AND CONDITIONS FOR COPYING, DISTRIBUTION AND MODIFICATION 70 | 71 | 0. This License Agreement applies to any software library or other program which contains a notice placed by the copyright holder or other authorized party saying it may be distributed under the terms of this Lesser General Public License (also called "this License"). Each licensee is addressed as "you". 72 | 73 | A "library" means a collection of software functions and/or data prepared so as to be conveniently linked with application programs (which use some of those functions and data) to form executables. 74 | 75 | The "Library", below, refers to any such software library or work which has been distributed under these terms. A "work based on the Library" means either the Library or any derivative work under copyright law: that is to say, a work containing the Library or a portion of it, either verbatim or with modifications and/or translated straightforwardly into another language. (Hereinafter, translation is included without limitation in the term "modification".) 76 | 77 | "Source code" for a work means the preferred form of the work for making modifications to it. For a library, complete source code means all the source code for all modules it contains, plus any associated interface definition files, plus the scripts used to control compilation and installation of the library. 78 | 79 | Activities other than copying, distribution and modification are not covered by this License; they are outside its scope. The act of running a program using the Library is not restricted, and output from such a program is covered only if its contents constitute a work based on the Library (independent of the use of the Library in a tool for writing it). Whether that is true depends on what the Library does and what the program that uses the Library does. 80 | 81 | 1. You may copy and distribute verbatim copies of the Library's complete source code as you receive it, in any medium, provided that you conspicuously and appropriately publish on each copy an appropriate copyright notice and disclaimer of warranty; keep intact all the notices that refer to this License and to the absence of any warranty; and distribute a copy of this License along with the Library. 82 | 83 | You may charge a fee for the physical act of transferring a copy, and you may at your option offer warranty protection in exchange for a fee. 84 | 85 | 2. You may modify your copy or copies of the Library or any portion of it, thus forming a work based on the Library, and copy and distribute such modifications or work under the terms of Section 1 above, provided that you also meet all of these conditions: 86 | 87 | a) The modified work must itself be a software library. 88 | b) You must cause the files modified to carry prominent notices stating that you changed the files and the date of any change. 89 | c) You must cause the whole of the work to be licensed at no charge to all third parties under the terms of this License. 90 | d) If a facility in the modified Library refers to a function or a table of data to be supplied by an application program that uses the facility, other than as an argument passed when the facility is invoked, then you must make a good faith effort to ensure that, in the event an application does not supply such function or table, the facility still operates, and performs whatever part of its purpose remains meaningful. 91 | 92 | (For example, a function in a library to compute square roots has a purpose that is entirely well-defined independent of the application. Therefore, Subsection 2d requires that any application-supplied function or table used by this function must be optional: if the application does not supply it, the square root function must still compute square roots.) 93 | 94 | These requirements apply to the modified work as a whole. If identifiable sections of that work are not derived from the Library, and can be reasonably considered independent and separate works in themselves, then this License, and its terms, do not apply to those sections when you distribute them as separate works. But when you distribute the same sections as part of a whole which is a work based on the Library, the distribution of the whole must be on the terms of this License, whose permissions for other licensees extend to the entire whole, and thus to each and every part regardless of who wrote it. 95 | 96 | Thus, it is not the intent of this section to claim rights or contest your rights to work written entirely by you; rather, the intent is to exercise the right to control the distribution of derivative or collective works based on the Library. 97 | 98 | In addition, mere aggregation of another work not based on the Library with the Library (or with a work based on the Library) on a volume of a storage or distribution medium does not bring the other work under the scope of this License. 99 | 100 | 3. You may opt to apply the terms of the ordinary GNU General Public License instead of this License to a given copy of the Library. To do this, you must alter all the notices that refer to this License, so that they refer to the ordinary GNU General Public License, version 2, instead of to this License. (If a newer version than version 2 of the ordinary GNU General Public License has appeared, then you can specify that version instead if you wish.) Do not make any other change in these notices. 101 | 102 | Once this change is made in a given copy, it is irreversible for that copy, so the ordinary GNU General Public License applies to all subsequent copies and derivative works made from that copy. 103 | 104 | This option is useful when you wish to copy part of the code of the Library into a program that is not a library. 105 | 106 | 4. You may copy and distribute the Library (or a portion or derivative of it, under Section 2) in object code or executable form under the terms of Sections 1 and 2 above provided that you accompany it with the complete corresponding machine-readable source code, which must be distributed under the terms of Sections 1 and 2 above on a medium customarily used for software interchange. 107 | 108 | If distribution of object code is made by offering access to copy from a designated place, then offering equivalent access to copy the source code from the same place satisfies the requirement to distribute the source code, even though third parties are not compelled to copy the source along with the object code. 109 | 110 | 5. A program that contains no derivative of any portion of the Library, but is designed to work with the Library by being compiled or linked with it, is called a "work that uses the Library". Such a work, in isolation, is not a derivative work of the Library, and therefore falls outside the scope of this License. 111 | 112 | However, linking a "work that uses the Library" with the Library creates an executable that is a derivative of the Library (because it contains portions of the Library), rather than a "work that uses the library". The executable is therefore covered by this License. Section 6 states terms for distribution of such executables. 113 | 114 | When a "work that uses the Library" uses material from a header file that is part of the Library, the object code for the work may be a derivative work of the Library even though the source code is not. Whether this is true is especially significant if the work can be linked without the Library, or if the work is itself a library. The threshold for this to be true is not precisely defined by law. 115 | 116 | If such an object file uses only numerical parameters, data structure layouts and accessors, and small macros and small inline functions (ten lines or less in length), then the use of the object file is unrestricted, regardless of whether it is legally a derivative work. (Executables containing this object code plus portions of the Library will still fall under Section 6.) 117 | 118 | Otherwise, if the work is a derivative of the Library, you may distribute the object code for the work under the terms of Section 6. Any executables containing that work also fall under Section 6, whether or not they are linked directly with the Library itself. 119 | 120 | 6. As an exception to the Sections above, you may also combine or link a "work that uses the Library" with the Library to produce a work containing portions of the Library, and distribute that work under terms of your choice, provided that the terms permit modification of the work for the customer's own use and reverse engineering for debugging such modifications. 121 | 122 | You must give prominent notice with each copy of the work that the Library is used in it and that the Library and its use are covered by this License. You must supply a copy of this License. If the work during execution displays copyright notices, you must include the copyright notice for the Library among them, as well as a reference directing the user to the copy of this License. Also, you must do one of these things: 123 | 124 | a) Accompany the work with the complete corresponding machine-readable source code for the Library including whatever changes were used in the work (which must be distributed under Sections 1 and 2 above); and, if the work is an executable linked with the Library, with the complete machine-readable "work that uses the Library", as object code and/or source code, so that the user can modify the Library and then relink to produce a modified executable containing the modified Library. (It is understood that the user who changes the contents of definitions files in the Library will not necessarily be able to recompile the application to use the modified definitions.) 125 | b) Use a suitable shared library mechanism for linking with the Library. A suitable mechanism is one that (1) uses at run time a copy of the library already present on the user's computer system, rather than copying library functions into the executable, and (2) will operate properly with a modified version of the library, if the user installs one, as long as the modified version is interface-compatible with the version that the work was made with. 126 | c) Accompany the work with a written offer, valid for at least three years, to give the same user the materials specified in Subsection 6a, above, for a charge no more than the cost of performing this distribution. 127 | d) If distribution of the work is made by offering access to copy from a designated place, offer equivalent access to copy the above specified materials from the same place. 128 | e) Verify that the user has already received a copy of these materials or that you have already sent this user a copy. 129 | 130 | For an executable, the required form of the "work that uses the Library" must include any data and utility programs needed for reproducing the executable from it. However, as a special exception, the materials to be distributed need not include anything that is normally distributed (in either source or binary form) with the major components (compiler, kernel, and so on) of the operating system on which the executable runs, unless that component itself accompanies the executable. 131 | 132 | It may happen that this requirement contradicts the license restrictions of other proprietary libraries that do not normally accompany the operating system. Such a contradiction means you cannot use both them and the Library together in an executable that you distribute. 133 | 134 | 7. You may place library facilities that are a work based on the Library side-by-side in a single library together with other library facilities not covered by this License, and distribute such a combined library, provided that the separate distribution of the work based on the Library and of the other library facilities is otherwise permitted, and provided that you do these two things: 135 | 136 | a) Accompany the combined library with a copy of the same work based on the Library, uncombined with any other library facilities. This must be distributed under the terms of the Sections above. 137 | b) Give prominent notice with the combined library of the fact that part of it is a work based on the Library, and explaining where to find the accompanying uncombined form of the same work. 138 | 139 | 8. You may not copy, modify, sublicense, link with, or distribute the Library except as expressly provided under this License. Any attempt otherwise to copy, modify, sublicense, link with, or distribute the Library is void, and will automatically terminate your rights under this License. However, parties who have received copies, or rights, from you under this License will not have their licenses terminated so long as such parties remain in full compliance. 140 | 141 | 9. You are not required to accept this License, since you have not signed it. However, nothing else grants you permission to modify or distribute the Library or its derivative works. These actions are prohibited by law if you do not accept this License. Therefore, by modifying or distributing the Library (or any work based on the Library), you indicate your acceptance of this License to do so, and all its terms and conditions for copying, distributing or modifying the Library or works based on it. 142 | 143 | 10. Each time you redistribute the Library (or any work based on the Library), the recipient automatically receives a license from the original licensor to copy, distribute, link with or modify the Library subject to these terms and conditions. You may not impose any further restrictions on the recipients' exercise of the rights granted herein. You are not responsible for enforcing compliance by third parties with this License. 144 | 145 | 11. If, as a consequence of a court judgment or allegation of patent infringement or for any other reason (not limited to patent issues), conditions are imposed on you (whether by court order, agreement or otherwise) that contradict the conditions of this License, they do not excuse you from the conditions of this License. If you cannot distribute so as to satisfy simultaneously your obligations under this License and any other pertinent obligations, then as a consequence you may not distribute the Library at all. For example, if a patent license would not permit royalty-free redistribution of the Library by all those who receive copies directly or indirectly through you, then the only way you could satisfy both it and this License would be to refrain entirely from distribution of the Library. 146 | 147 | If any portion of this section is held invalid or unenforceable under any particular circumstance, the balance of the section is intended to apply, and the section as a whole is intended to apply in other circumstances. 148 | 149 | It is not the purpose of this section to induce you to infringe any patents or other property right claims or to contest validity of any such claims; this section has the sole purpose of protecting the integrity of the free software distribution system which is implemented by public license practices. Many people have made generous contributions to the wide range of software distributed through that system in reliance on consistent application of that system; it is up to the author/donor to decide if he or she is willing to distribute software through any other system and a licensee cannot impose that choice. 150 | 151 | This section is intended to make thoroughly clear what is believed to be a consequence of the rest of this License. 152 | 153 | 12. If the distribution and/or use of the Library is restricted in certain countries either by patents or by copyrighted interfaces, the original copyright holder who places the Library under this License may add an explicit geographical distribution limitation excluding those countries, so that distribution is permitted only in or among countries not thus excluded. In such case, this License incorporates the limitation as if written in the body of this License. 154 | 155 | 13. The Free Software Foundation may publish revised and/or new versions of the Lesser General Public License from time to time. Such new versions will be similar in spirit to the present version, but may differ in detail to address new problems or concerns. 156 | 157 | Each version is given a distinguishing version number. If the Library specifies a version number of this License which applies to it and "any later version", you have the option of following the terms and conditions either of that version or of any later version published by the Free Software Foundation. If the Library does not specify a license version number, you may choose any version ever published by the Free Software Foundation. 158 | 159 | 14. If you wish to incorporate parts of the Library into other free programs whose distribution conditions are incompatible with these, write to the author to ask for permission. For software which is copyrighted by the Free Software Foundation, write to the Free Software Foundation; we sometimes make exceptions for this. Our decision will be guided by the two goals of preserving the free status of all derivatives of our free software and of promoting the sharing and reuse of software generally. 160 | 161 | NO WARRANTY 162 | 163 | 15. BECAUSE THE LIBRARY IS LICENSED FREE OF CHARGE, THERE IS NO WARRANTY FOR THE LIBRARY, TO THE EXTENT PERMITTED BY APPLICABLE LAW. EXCEPT WHEN OTHERWISE STATED IN WRITING THE COPYRIGHT HOLDERS AND/OR OTHER PARTIES PROVIDE THE LIBRARY "AS IS" WITHOUT WARRANTY OF ANY KIND, EITHER EXPRESSED OR IMPLIED, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE. THE ENTIRE RISK AS TO THE QUALITY AND PERFORMANCE OF THE LIBRARY IS WITH YOU. SHOULD THE LIBRARY PROVE DEFECTIVE, YOU ASSUME THE COST OF ALL NECESSARY SERVICING, REPAIR OR CORRECTION. 164 | 165 | 16. IN NO EVENT UNLESS REQUIRED BY APPLICABLE LAW OR AGREED TO IN WRITING WILL ANY COPYRIGHT HOLDER, OR ANY OTHER PARTY WHO MAY MODIFY AND/OR REDISTRIBUTE THE LIBRARY AS PERMITTED ABOVE, BE LIABLE TO YOU FOR DAMAGES, INCLUDING ANY GENERAL, SPECIAL, INCIDENTAL OR CONSEQUENTIAL DAMAGES ARISING OUT OF THE USE OR INABILITY TO USE THE LIBRARY (INCLUDING BUT NOT LIMITED TO LOSS OF DATA OR DATA BEING RENDERED INACCURATE OR LOSSES SUSTAINED BY YOU OR THIRD PARTIES OR A FAILURE OF THE LIBRARY TO OPERATE WITH ANY OTHER SOFTWARE), EVEN IF SUCH HOLDER OR OTHER PARTY HAS BEEN ADVISED OF THE POSSIBILITY OF SUCH DAMAGES. 166 | END OF TERMS AND CONDITIONS 167 | 168 | How to Apply These Terms to Your New Libraries 169 | 170 | If you develop a new library, and you want it to be of the greatest possible use to the public, we recommend making it free software that everyone can redistribute and change. You can do so by permitting redistribution under these terms (or, alternatively, under the terms of the ordinary General Public License). 171 | 172 | To apply these terms, attach the following notices to the library. It is safest to attach them to the start of each source file to most effectively convey the exclusion of warranty; and each file should have at least the "copyright" line and a pointer to where the full notice is found. 173 | 174 | one line to give the library's name and an idea of what it does. 175 | Copyright (C) year name of author 176 | 177 | This library is free software; you can redistribute it and/or 178 | modify it under the terms of the GNU Lesser General Public 179 | License as published by the Free Software Foundation; either 180 | version 2.1 of the License, or (at your option) any later version. 181 | 182 | This library is distributed in the hope that it will be useful, 183 | but WITHOUT ANY WARRANTY; without even the implied warranty of 184 | MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU 185 | Lesser General Public License for more details. 186 | 187 | You should have received a copy of the GNU Lesser General Public 188 | License along with this library; if not, write to the Free Software 189 | Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA 190 | 191 | Also add information on how to contact you by electronic and paper mail. 192 | 193 | You should also get your employer (if you work as a programmer) or your school, if any, to sign a "copyright disclaimer" for the library, if necessary. Here is a sample; alter the names: 194 | 195 | Yoyodyne, Inc., hereby disclaims all copyright interest in 196 | the library `Frob' (a library for tweaking knobs) written 197 | by James Random Hacker. 198 | 199 | signature of Ty Coon, 1 April 1990 200 | Ty Coon, President of Vice 201 | 202 | That's all there is to it! 203 | 204 | -------------------------------------------------- 205 | --------------------------------------------------------------------------------