Re: Binary expression tree
Jason Yeo <[email protected]>
| Newsgroups | gmane.comp.lang.ocaml.beginners |
|---|---|
| Message-ID | <CAM8f+Rk-Jr97caE6M4Pc_KZ6YnBFRD7HeGL-e=8hdifzpLBq4A@mail.gmail.com> |
Hi Johan,
I assume that you are planning to use ocaml{yacc/lex}. I have a repository
of a toy project that compiles a java-like language to arm. You can check
it out here https://github.com/jsyeo/cs4212-project3 .
Tutorials for ocamllex and ocamlyacc are here:
http://plus.kaist.ac.kr/~shoh/ocaml/ocamllex-ocamlyacc/ocamllex-tutorial/and
http://plus.kaist.ac.kr/~shoh/ocaml/ocamllex-ocamlyacc/ocamlyacc-tutorial/ .
Cheers,
Jason
On Tue, Feb 4, 2014 at 7:02 PM, Johan Mazel <[email protected]> wrote:
>
>
> Hi
> I want to parse and evaluate arithmetic expressions (not at the same time).
> I am looking for any bit of code linked to binary expression trees (data
> structure, lex/yacc, ...).
> Thanks in advance for your time.
> Johan
>
>
>
>