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
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
|
(**************************************************************************)
(* *)
(* SMTCoq *)
(* Copyright (C) 2011 - 2015 *)
(* *)
(* Michaël Armand *)
(* Benjamin Grégoire *)
(* Chantal Keller *)
(* *)
(* Inria - École Polytechnique - MSR-Inria Joint Lab *)
(* *)
(* This file is distributed under the terms of the CeCILL-C licence *)
(* *)
(**************************************************************************)
{
open VeritParser
exception Eof
let typ_table = Hashtbl.create 53
let _ =
List.iter (fun (kwd, tok) -> Hashtbl.add typ_table kwd tok)
[ "input", INPU;
"deep_res", DEEP;
"true", TRUE;
"false", FALS;
"and_pos", ANDP;
"and_neg", ANDN;
"or_pos", ORP;
"or_neg", ORN;
"xor_pos1", XORP1;
"xor_pos2", XORP2;
"xor_neg1", XORN1;
"xor_neg2", XORN2;
"implies_pos", IMPP;
"implies_neg1", IMPN1;
"implies_neg2", IMPN2;
"equiv_pos1", EQUP1;
"equiv_pos2", EQUP2;
"equiv_neg1", EQUN1;
"equiv_neg2", EQUN2;
"ite_pos1", ITEP1;
"ite_pos2", ITEP2;
"ite_neg1", ITEN1;
"ite_neg2", ITEN2;
"eq_reflexive", EQRE;
"eq_transitive", EQTR;
"eq_congruent", EQCO;
"eq_congruent_pred", EQCP;
"dl_generic", DLGE;
"lia_generic", LAGE;
"la_generic", LAGE;
"la_tautology", LATA;
"dl_disequality", DLDE;
"la_disequality", LADE;
"forall_inst", FINS;
"exists_inst", EINS;
"skolem_ex_ax", SKEA;
"skolem_all_ax", SKAA;
"qnt_simplify_ax", QNTS;
"qnt_merge_ax", QNTM;
"resolution", RESO;
"and", AND;
"not_or", NOR;
"or", OR;
"not_and", NAND;
"xor1", XOR1;
"xor2", XOR2;
"not_xor1", NXOR1;
"not_xor2", NXOR2;
"implies", IMP;
"not_implies1", NIMP1;
"not_implies2", NIMP2;
"equiv1", EQU1;
"equiv2", EQU2;
"not_equiv1", NEQU1;
"not_equiv2", NEQU2;
"ite1", ITE1;
"ite2", ITE2;
"not_ite1", NITE1;
"not_ite2", NITE2;
"tmp_alphaconv", TPAL;
"tmp_LA_pre", TLAP;
"tmp_let_elim", TPLE;
"tmp_nary_elim", TPNE;
"tmp_distinct_elim", TPDE;
"tmp_simp_arith", TPSA;
"tmp_ite_elim", TPIE;
"tmp_macrosubst", TPMA;
"tmp_betared", TPBR;
"tmp_bfun_elim", TPBE;
"tmp_sk_connector", TPSC;
"tmp_pm_process", TPPP;
"tmp_qnt_tidy", TPQT;
"tmp_qnt_simplify", TPQS;
"tmp_skolemize", TPSK;
"subproof", SUBP ]
}
let digit = [ '0'-'9' ]
let alpha = [ 'a'-'z' 'A' - 'Z' ]
let blank = [' ' '\t']
let newline = ['\n' '\r']
let var = alpha (alpha|digit|'_')*
let bindvar = '?' var+
let int = '-'? digit+
rule token = parse
| blank + { token lexbuf }
| newline + { EOL }
| ":" { COLON }
| "#" { SHARP }
| "(" { LPAR }
| ")" { RPAR }
| "not" { NOT }
| "xor" { XOR }
| "ite" { ITE }
| "=" { EQ }
| "<" { LT }
| "<=" { LEQ }
| ">" { GT }
| ">=" { GEQ }
| "+" { PLUS }
| "-" { MINUS }
| "~" { OPP }
| "*" { MULT }
| "=>" { IMP }
| "let" { LET }
| "distinct" { DIST }
| "Formula is Satisfiable" { SAT }
| int { try INT (int_of_string (Lexing.lexeme lexbuf))
with _ ->
BIGINT
(Big_int.big_int_of_string
(Lexing.lexeme lexbuf)) }
| var { let v = Lexing.lexeme lexbuf in
try Hashtbl.find typ_table v with
| Not_found -> VAR v }
| bindvar { BINDVAR (Lexing.lexeme lexbuf) }
| eof { raise Eof }
|
