package reparse-unix
Provides support for parsing files as source of input for reparse library
Install
Dune Dependency
Authors
Maintainers
Sources
reparse-unix-v2.0.0.tbz
sha256=93cee3d9f8842e85af5cb772f2586dccf1821f29959ee7f8effde1081cf650e7
sha512=69ee814e31af9a660a860b7768587a88e6fec4c918c05f237b3f665d67991a29cc8d8c2d55848b1cc38e75b712303cf225b66990cb80dbafce569e7e7b2166dd
README.md.html
Reparse
Reparse is a monadic, recursive descent based, comprehensive, parser construction library for ocaml.
Getting Started
$ opam install reparse
Add reparse
to dune,
(executable # or library
(name hello_world)
(public_name hello_world)
(libraries reparse))
Example - Calculator
A calculator is the hello world
of parsers. Here is an implementation in Reparse
which supports +,-,*
and /
operations.
module P = Reparse.Parser
open P.Infix
type expr =
| Int of int
| Add of expr * expr
| Sub of expr * expr
| Mult of expr * expr
| Div of expr * expr
let skip_spaces = P.skip P.space
let binop exp1 op exp2 f =
P.map3
(fun e1 _ e2 -> f e1 e2)
exp1
(skip_spaces *> P.char op <* skip_spaces)
exp2
let integer =
let+ d = P.digits in
Int (int_of_string d)
let factor expr =
P.any
[ P.char '(' *> skip_spaces *> expr <* skip_spaces <* P.char ')'
; skip_spaces *> integer <* skip_spaces ]
let term factor =
P.recur (fun term ->
let mult = binop factor '*' term (fun e1 e2 -> Mult (e1, e2)) in
let div = binop factor '/' term (fun e1 e2 -> Div (e1, e2)) in
mult <|> div <|> factor )
let expr =
P.recur (fun expr ->
let factor = factor expr in
let term = term factor in
let add = binop term '+' expr (fun e1 e2 -> Add (e1, e2)) in
let sub = binop term '-' expr (fun e1 e2 -> Sub (e1, e2)) in
P.any [add; sub; term] )
let rec eval = function
| Int i -> i
| Add (e1, e2) -> eval e1 + eval e2
| Sub (e1, e2) -> eval e1 - eval e2
| Mult (e1, e2) -> eval e1 * eval e2
| Div (e1, e2) -> eval e1 / eval e2
(* Test AST *)
let r =
let actual = P.parse_string expr "1*2-4+3" in
let expected = Sub (Mult (Int 1, Int 2), Add (Int 4, Int 3)) in
Bool.equal (expected = actual) true
(* Run and test the evaluator. *)
let exp_result =
let v = eval (P.parse_string expr "12+1*10") in
Int.equal 22 v
The expression grammar is defined by the following BNF grammar:
<expr> ::= <term> "+" <expr>
| <term>
<term> ::= <factor> "*" <term>
| <factor>
<factor> ::= "(" <expr> ")"
| integer
More Examples
Credits
https://github.com/MLton/mlton/blob/master/lib/mlton/basic/parse.sig
https://github.com/c-cube/ocaml-containers/blob/master/src/core/CCParse.mli
sectionYPositions = computeSectionYPositions($el), 10)"
x-init="setTimeout(() => sectionYPositions = computeSectionYPositions($el), 10)"
>