Needed mechanism for incremental generation of parsing trees

[lagodiuk]

Description of existing functionality:
Currently, parsing trees from the parsing forest - are being generated all at once. In the worst case - such behaviour might lead to exponential runtime complexity and exponential consumption of memory (in case of ambiguous grammar).

TODO:
It is possible to avoid exponential consumption of memory - by developing logic for incremental generation of parsing trees (e.g. using event-handler based approach). This change - requires slight reworking of parsing forest generation logic.

[lagodiuk]

I have started to work in the scope of branch: treverse_parse_forest_using_generators
I try to make use of ES6 mechanism of generators, in order to make the logic of the traversal of parse forest lazy (instead of eager), which should help to avoid the exponential consumption of memory.