| Age | Commit message (Collapse) | Author | |
|---|---|---|---|
| 2013-09-05 | Fix an old bug that prevented pattern matching agains values containg tables | hallgren | |
| The function GF.Grammar.PatternMatch.isInConstantForm returned False for all tables, causing matchPattern to fail, claiming that "variables occur in" the term if it contains tables. This problem is several years old, confirmed present in GF 3.2.10 (Oct 2010). | |||
| 2013-02-28 | pattern match length estimation code simplication | hallgren | |
| 2013-02-27 | Faster regular expression pattern matching in the grammar compiler. | hallgren | |
| The sequence operator (x+y) was implemented by splitting the string to be matched at all positions and trying to match the parts against the two subpatterns. To reduce the number of splits, we now estimate the minimum and maximum length of the string that the subpatterns could match. For common cases, where one of the subpatterns is a string of known length, like in (x+"y") or (x + ("a"|"o"|"u"|"e")+"y"), only one split will be tried. | |||
| 2012-11-07 | GF.Grammar.PatternMatch: relax overly restrictive type signatures | hallgren | |
| 2011-10-20 | Some experiments with PSeq (left commented out) | hallgren | |
| 2011-08-30 | PatternMatch.hs: commented out suspicious unused function varsOfPatt | hallgren | |
| 2010-05-28 | refactoring in GF.Grammar.Grammar | krasimir | |
| 2009-12-13 | reorganize the directories under src, and rescue the JavaScript interpreter ↵ | krasimir | |
| from deprecated | |||
