Commits

Amirouche Boubekki committed 57dbc29

added README.rst
removed README

Comments (0)

Files changed (2)

README

-How does the parser the parser run
-==================================
-
- 1) goto python-earley_parser
- 2) run with `make flat` for a flat output
- 2bis) run with `make dot` for a graphical output
-
-
-FAQ
-===
-
-Q: How to change the grammar ?
-A: Currently there is no easy way to change the grammar, check out 
-   `grammar_from_api@grammar.py` file to see current grammar.
-
-Q: How does it works ?
-A: the parser works in two step :
-   1) build earley super set, after the sentence given in input, 
-   see `parser@earley_parser`
-    a) complete, scan or do prediction on any generated item from ess.items list
-    b) when you finished a) a.k.a you can't add any items, clean up the mess, 
-    some items are usefull for the first step but won't be of any interrest for
-    the second step.
-   2) build parse trees based on cool item from `ess.items`, this step occurs, by now, 
-   in `ParseRuleSet@parse_tools.py` and `buid_parse_tree@earley_parser.py`
-   3) add semantic rules based on the parsed trees, be carful earley parser don't solve 
-   ambiguity, so you might end up with several trees !
-
-Q: How complex is the earley parser ?
-A: Based on Earley's paper it's a $n^3$ algorithm...
-
-Q: Which grammar can earley parser process ?
-A: Every grammar ever ! At least that's what I understood.
-
-Q: Where can I find out more about the earley algorithm ?
-A: check out mendley's output @ http://www.mendeley.com/research-papers/search/#0/earley
+How does the parser the parser run
+==================================
+
+ 1) goto python-earley_parser
+ 2) run with `make flat` for a flat output
+ 2bis) run with `make dot` for a graphical output
+
+
+FAQ
+===
+
+Q: How to change the grammar ?
+A: Currently there is no easy way to change the grammar, check out 
+   `grammar_from_api@grammar.py` file to see current grammar.
+
+Q: How does it works ?
+A: the parser works in two step :
+   1) build earley super set, after the sentence given in input, 
+   see `parser@earley_parser`
+    a) complete, scan or do prediction on any generated item from ess.items list
+    b) when you finished a) a.k.a you can't add any items, clean up the mess, 
+    some items are usefull for the first step but won't be of any interrest for
+    the second step.
+   2) build parse trees based on cool item from `ess.items`, this step occurs, by now, 
+   in `ParseRuleSet@parse_tools.py` and `buid_parse_tree@earley_parser.py`
+   3) add semantic rules based on the parsed trees, be carful earley parser don't solve 
+   ambiguity, so you might end up with several trees !
+
+Q: How complex is the earley parser ?
+A: Based on Earley's paper it's a $n^3$ algorithm...
+
+Q: Which grammar can earley parser process ?
+A: Every grammar ever ! At least that's what I understood.
+
+Q: Where can I find out more about the earley algorithm ?
+A: check out mendley's output @ http://www.mendeley.com/research-papers/search/#0/earley