On Tue, Apr 27, 2010 at 06:31:01AM +0200, Stéphane Payrard wrote: > When doing an analyse of a sample parse tree, I note that it is > cluttered by the reduction of optional subrules > to generate a zero length parse subtree. That is, rules with a '?' > quantifier matching zero time. > Suppressing such matching rules from the parse tree would make it > easier to read.
I suppose it would also make the parse tres considerably smaller. I wonder how much of Rakudo's memory usage (currently 361 MiB peak in the setting) is caused by parse trees, and how much this optimization would help? -sorear
signature.asc
Description: Digital signature
