thomasave
/
Parsodus
1
0
Fork 0
Code Issues Pull Requests Packages Projects Releases Wiki Activity

README fix

This commit is contained in:
Robin Jadoul 2017-01-18 11:51:11 +01:00
parent 8148c41179
commit 3bb2004fdc
1 changed files with 3 additions and 3 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

6
README.md
View File

@ -12,7 +12,7 @@ A language agnostic parser generator
* [Authors](#authors) * [Authors](#authors)
## Introduction ## Introduction
Lexesis is a language agnostic parser generator. Which means that it uses a description of a grammar in a kind of BNF notation, and outputs source files for a parser (which can be in any language for which a backend has been built, currently only c++), using a specified parsing algorithm (currently 4 kinds of LR parser have been implemented). This parser can then be augmented with rule handling to build an abstract structure representing the data, doing computations immediately, or anything else you can imagine. Parsodus is a language agnostic parser generator. Which means that it uses a description of a grammar in a kind of BNF notation, and outputs source files for a parser (which can be in any language for which a backend has been built, currently only c++), using a specified parsing algorithm (currently 4 kinds of LR parser have been implemented). This parser can then be augmented with rule handling to build an abstract structure representing the data, doing computations immediately, or anything else you can imagine.
It's principle is very similar to the well known tools such as [yacc](https://en.wikipedia.org/wiki/Yacc) or [bison](https://www.gnu.org/software/bison/), which the difference that Parsodus has a simpler input format, and does not depend on language specific actions to be specified in the configuration file. It uses a programming language independent description of the grammar, along with optional naming for the rules, in order to allow a bigger reusability across different programming languages of the same parser specification. It's principle is very similar to the well known tools such as [yacc](https://en.wikipedia.org/wiki/Yacc) or [bison](https://www.gnu.org/software/bison/), which the difference that Parsodus has a simpler input format, and does not depend on language specific actions to be specified in the configuration file. It uses a programming language independent description of the grammar, along with optional naming for the rules, in order to allow a bigger reusability across different programming languages of the same parser specification.
This project came into existence as an application exercise in a course on languages and turing machines for the University of Antwerp, and can be considered a continuation of Lexesis (a lexical analyser generator). This project came into existence as an application exercise in a course on languages and turing machines for the University of Antwerp, and can be considered a continuation of Lexesis (a lexical analyser generator).
@ -52,7 +52,7 @@ Get your terminal in the source tree and run the following commands:
make make
make install make install
This will place the Lexesis executable in the `build/bin` folder, with some extra needed data for Parsodus in `build/share` This will place the Parsodus executable in the `build/bin` folder, with some extra needed data for Parsodus in `build/share`
You can now simply run `./bin/Parsodus` with the arguments you like (see below and in the man pages for an overview). You can now simply run `./bin/Parsodus` with the arguments you like (see below and in the man pages for an overview).
If you want to build the documentation as well, simply run If you want to build the documentation as well, simply run
@ -69,7 +69,7 @@ Now that Parsodus is successfully built and your terminal is in the `build` fold
### The input file ### The input file
Input files for Lexesis have a `.pds` extension and have a set of some very simple rules: Input files for Parsodus have a `.pds` extension and have a set of some very simple rules:
Variables in the grammar follow the regular expression `<[a-zA-Z_][a-zA-Z0-9_]*>`, and terminals use the same scheme, except using double quotes instead of angular brackets. Variables in the grammar follow the regular expression `<[a-zA-Z_][a-zA-Z0-9_]*>`, and terminals use the same scheme, except using double quotes instead of angular brackets.
Furthermore, Parsodus uses a couple of key-value associations, including Furthermore, Parsodus uses a couple of key-value associations, including