A small parsing experiment
Go to file
Bruno BELANYI 8201523d8b project: add MIT license 2020-12-12 15:31:15 +01:00
src evalexpr: parse: do not use operator kind directly 2020-11-02 16:13:33 +01:00
tests evalexpr: tests: reduce repetition using X macros 2020-11-02 16:13:33 +01:00
.drone.yml ci: add Drone CI 2020-11-02 15:48:30 +01:00
.gitignore git: ignore testsuite binary 2020-11-02 15:48:30 +01:00
LICENSE project: add MIT license 2020-12-12 15:31:15 +01:00
Makefile evalexpr: tests: add Criterion testsuite 2020-11-02 15:48:30 +01:00
README.md doc: add README 2020-11-02 15:48:30 +01:00



This was a small experiment in writing a precedence climbing parser, using C. I also have my reference parsing implementation, using recursive descent, to compare the parsing results.

This is mostly based on the explanation found at this address: https://www.engr.mun.ca/~theo/Misc/exp_parsing.htm (use the Wayback Machine to read it).

How to build

Simply launch the following command

42sh$ make

If you want to build an evalexpr command using recursive descent instead, use:

42sh$ make USE_CLIMBING=0

Don't forget to use make clean when alternating between both.

How to use

Simply launch the binary, and write an expression on its standard input. The binary can parse exactly one expression per line, and reports parsing errors if they happen.

Example use:

42sh$ ./evalexpr
1 + 2 * 3 - 3!