-
Notifications
You must be signed in to change notification settings - Fork 0
/
fixLex.mll
141 lines (133 loc) · 4.62 KB
/
fixLex.mll
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
(*
* Copyright © 1990-2002 The Regents of the University of California. All rights reserved.
*
* Permission is hereby granted, without written agreement and without
* license or royalty fees, to use, copy, modify, and distribute this
* software and its documentation for any purpose, provided that the
* above copyright notice and the following two paragraphs appear in
* all copies of this software.
*
* IN NO EVENT SHALL THE UNIVERSITY OF CALIFORNIA BE LIABLE TO ANY PARTY
* FOR DIRECT, INDIRECT, SPECIAL, INCIDENTAL, OR CONSEQUENTIAL DAMAGES
* ARISING OUT OF THE USE OF THIS SOFTWARE AND ITS DOCUMENTATION, EVEN
* IF THE UNIVERSITY OF CALIFORNIA HAS BEEN ADVISED OF THE POSSIBILITY
* OF SUCH DAMAGE.
*
* THE UNIVERSITY OF CALIFORNIA SPECIFICALLY DISCLAIMS ANY WARRANTIES,
* INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY
* AND FITNESS FOR A PARTICULAR PURPOSE. THE SOFTWARE PROVIDED HEREUNDER IS
* ON AN "AS IS" BASIS, AND THE UNIVERSITY OF CALIFORNIA HAS NO OBLIGATION
* d
* TO PROVIDE MAINTENANCE, SUPPORT, UPDATES, ENHANCEMENTS, OR MODIFICATIONS.
*
*)
{
open Misc.Ops
module E = Errorline
open E
open FixParse
let lexerror msg lexbuf =
E.error (Lexing.lexeme_start lexbuf) msg
}
let digit = ['0'-'9' '-']
let letdig = ['0'-'9' 'a'-'z' 'A'-'Z' '_' '@' ''' '.' '#']
let alphlet = ['A'-'Z' 'a'-'z' '~' '_' ''' '@' ]
let capital = ['A'-'Z']
let small = ['a'-'z' '$' '_']
let ws = [' ' '\009' '\012']
let pathname = ['a'-'z' 'A'-'Z' '0'-'9' '.' '/' '\\' '-']
(* let hcid = ['0'-'9' ',' '-' '[' ']'] *)
rule token = parse
['\r''\t'' '] { token lexbuf}
| '\n' { begin
E.startNewline (Lexing.lexeme_end lexbuf);
token lexbuf
end }
| "//"[^'\n']*'\n'
{ begin
E.startNewline (Lexing.lexeme_end lexbuf);
token lexbuf
end
}
| '[' { LB }
| ']' { RB }
| '(' { LPAREN }
| ')' { RPAREN }
| '{' { LC }
| '}' { RC }
| '~' { NOT }
| ';' { SEMI }
| ',' { COMMA }
| ':' { COLON }
| '|' { MID }
| '+' { PLUS }
| '-' { MINUS }
| '*' { TIMES }
| '/' { DIV }
| '?' { QM }
| '.' { DOT }
| "not" { NOTWORD }
| "tag" { TAG }
| "id" { ID }
| "Bexp" { BEXP }
| "false" { FALSE }
| "true" { TRUE }
| ":=" { ASGN }
| "&&" { AND }
| "||" { OR }
| "<=>" { IFF }
| "iff" { IFFWORD }
| "=>" { IMPL }
| "!=" { NE }
| "=" { EQ }
| "<=" { LE }
| "<" { LT }
| ">=" { GE }
| ">" { GT }
| "mod" { MOD }
| "obj" { OBJ }
| "num" { NUM }
| "int" { INT }
| "ptr" { PTR }
| "<fun>" { LFUN }
(* | "fptr" { FPTR } *)
| "bool" { BOOL }
| "uit" { UNINT }
| "func" { FUNC }
| "sort" { SRT }
| "axiom" { AXM }
| "constant" { CON }
| "constraint" { CST }
| "wf" { WF }
| "solution" { SOL }
| "qualif" { QUL }
| "add_dep" { ADP }
| "del_dep" { DDP }
| "env" { ENV }
| "grd" { GRD }
| "lhs" { LHS }
| "rhs" { RHS }
| "reft" { REF }
| "@" { TVAR }
| (digit)+ { let str = Lexing.lexeme lexbuf in
let len = String.length str in
let zero = Char.code '0' in
let rec accum a d =
let acc c = a + (d * ((Char.code c) - zero)) in
function
0 -> let c = str.[0] in
if c='-' then - a else (acc c)
| i -> accum (acc str.[i]) (d * 10) (i - 1)
in
Num (accum 0 1 (len-1)) }
| (alphlet)letdig* { Id (Lexing.lexeme lexbuf) }
| '''[^''']*''' { let str = Lexing.lexeme lexbuf in
let len = String.length str in
Id (String.sub str 1 (len-2)) }
| eof { EOF }
| _ {
begin
lexerror ("Illegal Character '" ^
(Lexing.lexeme lexbuf) ^ "'") lexbuf;
token lexbuf
end }