package fmlib_parse

  1. Overview
  2. Docs

Source file test_operator_expression.ml

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
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
open Fmlib_std

type assoc =
    | Left
    | Right


type info = {
    precedence: int;
    associativity: assoc;
}

let left (p: int): info =
    assert (0 <= p);
    {
        precedence = p;
        associativity = Left;
    }

let right (p: int): info =
    assert (0 <= p);
    {
        precedence = p;
        associativity = Right;
    }

module Map =
struct
    include Btree.Map (Char)
    let find c map =
        match find_opt c map with
        | None ->
            assert false
        | Some r ->
            r
end



let operators: string =
    "+-*/^!&|"


let map: 'info Map.t =
    let open Map in
    empty
    |> add '|' (left 10)
    |> add '&' (left 20)
    |> add '!' (left 30)
    |> add '+' (left 40)
    |> add '-' (left 40)
    |> add '*' (left 50)
    |> add '/' (left 50)
    |> add '^' (right 60)


let is_left0 (o1: char) (o2: char): bool =
    let i1 = Map.find o1 map
    and i2 = Map.find o2 map
    in
    i1.precedence > i2.precedence
    ||
    (
        i1.precedence = i2.precedence
        &&
        i1.associativity = Left
    )



module CP =
    Character.Make (Unit) (String) (String)

open CP


let is_left (a: char) (b: char): bool t =
    return (is_left0 a b)

let operator: char t =
    one_of_chars operators ("one of \"" ^ operators ^ "\"")

let make_unary (u: char) (a: string): string t =
    return ("(" ^ String.one u ^ a ^ ")")

let make_binary (a: string) (o: char) (b: string): string t =
    return ("(" ^ a ^ String.one o ^ b ^ ")")


let primary: string t =
    map String.one letter

let lpar: char t =
    (
        let* _ = char '(' in
        return ')'
    )
    </>
    (
        let* _ = char '[' in
        return ']'
    )
    </>
    (
        let* _ = char '{' in
        return '}'
    )

let rpar (p: char): char t =
    charp (fun c -> c = p) ("'" ^ String.one p ^ "'")


let rec exp (): string t =
    let prim () =
        parenthesized
            (fun _ a _ -> return a)
            lpar
            exp
            rpar
        </>
        primary
    in
    operator_expression
        (prim ())
        (Some operator)
        operator
        is_left
        make_unary
        make_binary


let parse: Parser.t =
    make
        ()
        (exp ())






let%test _ =
    let p = Parser.run_on_string "a" parse in
    Parser.(
        has_succeeded p
        &&
        column p = 1
        &&
        final p = "a"
    )




let%test _ =
    let p = Parser.run_on_string "a+-b+c" parse in
    Parser.(
        has_succeeded p
        &&
        final p = "((a+(-b))+c)"
    )




let%test _ =
    let p = Parser.run_on_string "a+b*c" parse in
    Parser.(
        has_succeeded p
        &&
        final p = "(a+(b*c))"
    )




let%test _ =
    let p = Parser.run_on_string "[a*{b+[[[(((c)))]]]}]^d" parse in
    Parser.(
        has_succeeded p
        &&
        final p = "((a*(b+c))^d)"
    )




let%test _ =
    let p = Parser.run_on_string "a*-b*c" parse in
    Parser.(
        has_succeeded p
        &&
        final p = "(a*(-(b*c)))"
    )




let%test _ =
    let p = Parser.run_on_string "a+b^c^d" parse in
    Parser.(
        has_succeeded p
        &&
        final p = "(a+(b^(c^d)))"
    )




let%test _ =
    let p = Parser.run_on_string "a+b*c^d" parse in
    Parser.(
        has_succeeded p
        &&
        final p = "(a+(b*(c^d)))"
    )




let%test _ =
    let p = Parser.run_on_string "a+!b+c" parse in
    Parser.(
        has_succeeded p
        &&
        final p = "(a+(!(b+c)))"
    )
OCaml

Innovation. Community. Security.