Allan Odgaard 2bd7b877e6 Tag rules in grammar with wether or not they have been seen ...

This is instead of keeping a std::set with rule identifiers. Keeping the information in the grammar is a lot faster (about 25%) as we can update the status in O(1) without any memory allocation.

The downside is that the grammar is now being mutated by the parser. This is currently safe because only a single thread is used for parsing. When we switch to allowing multiple threads to perform parsing, we should make a copy of the grammar for each instance.

Another downside is that we only tag rules that have begin/match patterns, so rules that are wrappers for a set of rules, or rules that are including another rule, are never rejected, even if already visited, but the target rules they resolve to will be, though if an include (indirectly) include itself, we will no longer break such cycle (though it is clearly a bug in the grammar, if this happens, and we could preprocess the grammar to catch it).

2013-08-18 17:29:29 +02:00

..

src

Tag rules in grammar with wether or not they have been seen

2013-08-18 17:29:29 +02:00

tests

Do not use global constructors for fixtures

2013-08-16 22:40:08 +02:00

target

Update testing system for parse framework

2013-07-26 13:53:57 +02:00