 10 Feb, 2020 29 commits


POTTIER Francois authored

POTTIER Francois authored

POTTIER Francois authored

POTTIER Francois authored

POTTIER Francois authored

POTTIER Francois authored
Information about the maximum heap size can no longer be logged to stdout, as it is machinedependent.

POTTIER Francois authored

POTTIER Francois authored
Build Menhir's stage2 parser in nopager mode instead of canonical mode. We go down from 368 to 298 states, and from 105 to 101 error states. Nothing else changes.

POTTIER Francois authored

POTTIER Francois authored

POTTIER Francois authored
Maximal first builds the maximal automaton, then attempts to minimize it. The first phase is made obsolete by LR1Pager (ModeInclusionOnly) which also computes the maximal automaton, but is more efficient. The second phase (minimization) could still be of interest in the future. It is based on an ad hoc solver for Horn clauses.

POTTIER Francois authored

POTTIER Francois authored

POTTIER Francois authored

POTTIER Francois authored

POTTIER Francois authored

POTTIER Francois authored

POTTIER Francois authored

POTTIER Francois authored

POTTIER Francois authored

POTTIER Francois authored

POTTIER Francois authored

POTTIER Francois authored

POTTIER Francois authored

POTTIER Francois authored

POTTIER Francois authored
This means that the old implementation of Pager's algorithm is replaced with the new one; as a result, the automata that are produced can have either more states or fewer states. The construction can be up to 2x slower. In canonical mode, the automata that are produced should be unchanged, up to the numbering of states; the construction should be about 2x faster. This closes issue #21.

POTTIER Francois authored

POTTIER Francois authored

POTTIER Francois authored

 04 Feb, 2020 1 commit


POTTIER Francois authored

 03 Feb, 2020 2 commits


POTTIER Francois authored

POTTIER Francois authored
This allows this situation to be detected by [make test]. About 19 grammars in the test suite are affected, which is more than I expected. Some of these are related to issue #21. Some of these could be conflicts that arise in unreachable nodes (a known issue). None are artificial conflicts caused by lalr (I have checked).

 02 Feb, 2020 2 commits


POTTIER Francois authored

POTTIER Francois authored

 31 Jan, 2020 6 commits


POTTIER Francois authored

POTTIER Francois authored
Add a comment relating the test [cutdown] to issue #21, and add two new tests related to this issue, [issue21_shorter] and [issue21_longer].

POTTIER Francois authored

POTTIER Francois authored
Add [LR1CanonicalAsTraversal], a new formulation of the construction of the canonical automaton as a graph traversal. This new construction appears to be about twice faster than the previous one in [LR1CanonicalAsFixedPoint].

POTTIER Francois authored

POTTIER Francois authored
In [Lr0], remove [new_numbering] and expose [Lr1stateAsOrderedType] instead. Use this to simplify [Lr1canonical].
