1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
|
(****************************************************************************)
(* the diy toolsuite *)
(* *)
(* Jade Alglave, University College London, UK. *)
(* Luc Maranget, INRIA Paris-Rocquencourt, France. *)
(* *)
(* Copyright 2017-present Institut National de Recherche en Informatique et *)
(* en Automatique and the authors. All rights reserved. *)
(* *)
(* This software is governed by the CeCILL-B license under French law and *)
(* abiding by the rules of distribution of free software. You can use, *)
(* modify and/ or redistribute the software under the terms of the CeCILL-B *)
(* license as circulated by CEA, CNRS and INRIA at the following URL *)
(* "http://www.cecill.info". We also give a copy in LICENSE.txt. *)
(****************************************************************************)
{
module type Config = sig
val sync : bool
val deref : bool
end
module type Out = sig
type t
val put_char : t -> char -> unit
val put : t -> string -> unit
end
module Make(O:Config)(Out:Out) = struct
}
let blank = [' ''\t']
let alpha = ['a'-'z''A'-'Z']
let num = ['0'-'9']
let reg = alpha (alpha|num)*
rule main out = parse
| '(' blank* "xor" blank+ (reg as r1) blank+ (reg as r2) ')' as lxm
{
begin if r1 = r2 then
Out.put out (Printf.sprintf "(and %s 128)" r1)
else
Out.put out lxm
end ;
main out lexbuf
}
| '(' blank* "and" blank+ (reg as r1) blank+ "0" ')'
{
Out.put out (Printf.sprintf "(and %s 128)" r1) ;
main out lexbuf }
| "f[sync]" as token
{ if O.sync then false else begin
Out.put out token ;
main out lexbuf
end }
| "[deref]"|"[lderef]" as token
{ if O.deref then false else begin
Out.put out token ;
main out lexbuf
end }
| _ as c { Out.put_char out c ; main out lexbuf }
| eof { true }
{
let tr out lexbuf = main out lexbuf
end
}
|
