--- /dev/null
+The following changes (change numbers refer to perforce) were\r
+made from version 3.1.1 to 3.1.2\r
+\r
+Runtime\r
+-------\r
+\r
+Change 5641 on 2009/02/20 by jimi@jimi.jimi.antlr3\r
+\r
+ Release version 3.1.2 of the ANTLR C runtime.\r
+ \r
+ Updated documents and release notes will have to follow later.\r
+\r
+Change 5639 on 2009/02/20 by jimi@jimi.jimi.antlr3\r
+\r
+ Fixed: ANTLR-356\r
+ \r
+ Ensure that code generation for C++ does not require casts\r
+\r
+Change 5577 on 2009/02/12 by jimi@jimi.jimi.antlr3\r
+\r
+ C Runtime - Bug fixes.\r
+ \r
+ o Having moved to use an extract directly from a vector for returning \r
+ tokens, it exposed a\r
+ bug whereby the EOF boudary calculation in tokLT was incorrectly \r
+ checking > rather than >=. \r
+ o Changing to API initialization of tokens rather than memcmp() \r
+ incorrectly forgot to set teh input stream pointer for the \r
+ manufactured tokens in the token factory;\r
+ o Rewrite streams for rewriting tree parsers did not check whether the \r
+ rewrite stream was ever assigned before trying to free it, it is now \r
+ in line with the ordinary parser code.\r
+\r
+Change 5576 on 2009/02/11 by jimi@jimi.jimi.antlr3\r
+\r
+ C Runtime: Ensure that when we manufacture a new token for a missing \r
+ token, that the user suplied custom information (if any) is copied \r
+ from the current token.\r
+\r
+Change 5575 on 2009/02/08 by jimi@jimi.jimi.antlr3\r
+\r
+ C Runtime - Vastly improve the reuse of allocated memory for nodes in \r
+ tree rewriting.\r
+ \r
+ A problem for all targets at the moment si that the rewrite logic \r
+ generated by ANTLR makes no attempt\r
+ to reuse any resources, it merely gurantees that the tree shape at the \r
+ end is correct. To some extent this is mitigated by the garbage \r
+ collection systems of Java and .Net, even thoguh it is still an overhead to\r
+ keep creating so many modes.\r
+ \r
+ This change implements the first of two C runtime changes that make \r
+ best efforst to track when a node has become orphaned and will never \r
+ be reused, based on inherent knowledge of the rewrite logic (which in\r
+ the long term is not a great soloution). \r
+ \r
+ Much of the rewrite logic consists of creating a niilnode into which \r
+ child nodes are appended. At: rulePost processing time; when a rewrite \r
+ stream is closed; and when becomeRoot is called, there are many situations\r
+ where the root of the tree that will be manipulted, or is finished with \r
+ (in the case of rewrtie streams), where the nilNode was just a temporary \r
+ creation for the sake of the rewrite itself. \r
+ \r
+ In these cases we can see that the nilNode would just be left ot rot in \r
+ the node factory that tracks all the tree nodes.\r
+ Rather than leave these in the factory to rot, we now keep a resuse \r
+ stck and always reuse any node on this\r
+ stack before claimin a new node from the factory pool.\r
+ \r
+ This single change alone reduces memory usage in the test case (20,604 \r
+ line C program and a GNU C parser) \r
+ from nearly a GB, to 276MB. This is still way more memory than we \r
+ shoudl need to do this operation, even on such a large input file,\r
+ but the reduction results in a huge performance increase and greatly \r
+ reduced system time spent on allocations.\r
+ \r
+ After this optimizatoin, comparison with gcc yeilds:\r
+ \r
+ time gcc -S a.c\r
+ a.c:1026: warning: conflicting types for built-in function ‘vsprintf’\r
+ a.c:1030: warning: conflicting types for built-in function ‘vsnprintf’\r
+ a.c:1041: warning: conflicting types for built-in function ‘vsscanf’\r
+ 0.21user 0.01system 0:00.22elapsed 97%CPU (0avgtext+0avgdata 0maxresident)k\r
+ 0inputs+240outputs (0major+8345minor)pagefaults 0swaps\r
+ \r
+ and\r
+ \r
+ time ./jimi\r
+ Reading a.c\r
+ 0.28user 0.11system 0:00.39elapsed 98%CPU (0avgtext+0avgdata 0maxresident)k\r
+ 0inputs+0outputs (0major+66609minor)pagefaults 0swaps\r
+ \r
+ And we can now interpolate the fact that the only major differnce is \r
+ now the huge disparity in memory allocations. A\r
+ future optimization of vector pooling, to sepate node resue from vector \r
+ reuse, currently looks promising for further reuse of memory.\r
+ \r
+ Finally, a static analysis of the rewrte code, plus a realtime analysis \r
+ of the heap at runtime, may well give us a reasonable memory usage \r
+ pattern. In reality though, it is the generated rewrite logic\r
+ that must becom optional at not continuously rewriting things that it \r
+ need not, as it ascends the rule chain.\r
+\r
+Change 5563 on 2009/01/28 by jimi@jimi.jimi.antlr3\r
+\r
+ Allow rewrite streams to use the base adaptors vector factory and not \r
+ try to malloc new vectors themselves.\r
+\r
+Change 5562 on 2009/01/28 by jimi@jimi.jimi.antlr3\r
+\r
+ Don't use CALLOC to allocate tree pools, use malloc as there is no need \r
+ for calloc.\r
+\r
+Change 5561 on 2009/01/28 by jimi@jimi.jimi.antlr3\r
+\r
+ Prevent warnigsn about retval.stop not being initialized when a rule \r
+ returns eraly because it is in backtracking mode\r
+\r
+Change 5558 on 2009/01/28 by jimi@jimi.jimi.antlr3\r
+\r
+ Lots of optimizations (though the next one to be checked in is the huge \r
+ win) for AST building and vector factories.\r
+ \r
+ A large part of tree rewriting was the creation of vectors to hold AST \r
+ nodes. Although I had created a vector factory, for some reason I never got \r
+ around to creating a proper one, that pre-allocated the vectors in chunks and \r
+ so on. I guess I just forgot to. Hence a big win here is prevention of calling \r
+ malloc lots and lots of times to create vectors.\r
+ \r
+ A second inprovement was to change teh vector definition such that it \r
+ holds a certain number of elements wihtin the vector structure itself, rather \r
+ than malloc and freeing these. Currently this is set to 8, but may increase. \r
+ For AST construction, this is generally a big win because AST nodes don't often \r
+ have many individual children unless there has not been any shaping going on in \r
+ the parser. But if you are not shaping, then you don't really need a tree.\r
+ \r
+ Other perforamnce inprovements here include not calling functions \r
+ indirectly within token stream and common token stream. Hence tokens are \r
+ claimed directly from the vectors. Users can override these funcitons of course \r
+ and all this means is that if you override tokenstreams then you pretty much \r
+ have to provide all the mehtods, but then I think you woudl have to anyway (and \r
+ I don't know of anyone that has wanted to do this as you can carry your own \r
+ structure around with the tokens anyway and that is much easier).\r
+\r
+Change 5555 on 2009/01/26 by jimi@jimi.jimi.antlr3\r
+\r
+ Fixed: ANTLR-288\r
+ Correct the interpretation of the skip token such that channel, start \r
+ index, char pos in lie, start line and text are correctly reset to the start of \r
+ the new token when the one that we just traversed was marked as being skipped. \r
+ \r
+ This correctly excludes the text that was matched as part of the \r
+ SKIP()ed token from the next token in the token stream and so has the side \r
+ effect that asking for $text of a rule no longer includes the text that shuodl \r
+ be skipped, but DOES include the text of tokens that were merely placed off the \r
+ default channel.\r
+\r
+Change 5551 on 2009/01/25 by jimi@jimi.jimi.antlr3\r
+\r
+ Fixed: ANTLR-287\r
+ Most of the source files did not include the BSD license. THis might\r
+ not be that big a deal given that I don't care what people do with it\r
+ other than take my name off it, but having the license reproduced \r
+ everywhere\r
+ at least makes things perfectly clear. Hence this mass change of \r
+ sources and templates\r
+ to include the license.\r
+\r
+Change 5550 on 2009/01/25 by jimi@jimi.jimi.antlr3\r
+\r
+ Fixed: ANTLR-365\r
+ Ensure that as soon as we known about an input stream on the lexer that\r
+ we borrow its string factroy adn use it in our EOF token in case\r
+ anyone tries to make it a string, such as in error messages for \r
+ instance.\r
+\r
+Change 5548 on 2009/01/25 by jimi@jimi.jimi.antlr3\r
+\r
+ Fixed: ANTLR-363\r
+ At some point the Java runtime default changed from discarding offchannel\r
+ tokens to preserving them. The fix is to make the C runtime also \r
+ default to preserving off-channel tokens.\r
+\r
+Change 5544 on 2009/01/24 by jimi@jimi.jimi.antlr3\r
+\r
+ Fixed: ANTLR-360\r
+ Ensure that the fillBuffer funtiion does not call any methods\r
+ that require the cached buffer size to be recorded before we\r
+ have actually recorded it.\r
+\r
+Change 5543 on 2009/01/24 by jimi@jimi.jimi.antlr3\r
+\r
+ Fixed: ANTLR-362\r
+ Some users have started using string factories themselves and\r
+ exposed a flaw in the destroy method, that is intended to remove\r
+ a strng htat was created by the factory and is no longer needed.\r
+ The string was correctly removed from the vector that tracks them\r
+ but after the first one, all the remaining strings are then numbered\r
+ incorrectly. Hence the destroy method has been recoded to reindex\r
+ the strings in the factory after one is removed and everythig is once\r
+ more hunky dory.\r
+ User suggested fix rejected.\r
+\r
+Change 5542 on 2009/01/24 by jimi@jimi.jimi.antlr3\r
+\r
+ Fixed ANTLR-366\r
+ The recognizer state now ensures that all fields are set to NULL upon \r
+creation\r
+ and the reset does not overwrite the tokenname array\r
+\r
+Change 5527 on 2009/01/15 by jimi@jimi.jimi.antlr3\r
+\r
+ Add the C runtime for 3.1.2 beta2 to perforce\r
+\r
+Change 5526 on 2009/01/15 by jimi@jimi.jimivista.antlr3\r
+\r
+ Correctly define the MEMMOVE macro which was inadvertently left to be \r
+ memcpy.\r
+\r
+Change 5503 on 2008/12/12 by jimi@jimi.jimi.antlr3\r
+\r
+ Change C runtime release number to 3.1.2 beta\r
+\r
+Change 5473 on 2008/12/01 by jimi@jimi.jimivista.antlr3\r
+\r
+ Fixed: ANTLR-350 - C runtime use of memcpy\r
+ Prior change to use memcpy instead of memmove in all cases missed the \r
+ fact that the string factory can be in a situation where overlaps occur. We now \r
+ have ANTLR3_MEMCPY and ANTLR3_MEMMOVE and use the two appropriately.\r
+\r
+Change 5471 on 2008/12/01 by jimi@jimi.jimivista.antlr3\r
+\r
+ Fixed ANTLR-361\r
+ - Ensure that ANTLR3_BOOLEAN is typedef'ed correctly when building for \r
+ MingW\r
+\r
+Templates\r
+---------\r
+\r
+Change 5637 on 2009/02/20 by jimi@jimi.jimi.antlr3\r
+\r
+ C rtunime - make sure that ADAPTOR results are cast to the tree type on \r
+ a rewrite\r
+\r
+Change 5620 on 2009/02/18 by jimi@jimi.jimi.antlr3\r
+\r
+ Rename/Move:\r
+ From: //depot/code/antlr/main/src/org/antlr/codegen/templates/...\r
+ To: //depot/code/antlr/main/src/main/resources/org/antlr/codegen/templates/...\r
+ \r
+ Relocate the code generating templates to exist in the directory set \r
+ that maven expects.\r
+ \r
+ When checking in your templates, you may find it easiest to make a copy \r
+ of what you have, revert the change in perforce, then just check out the \r
+ template in the new location, and copy the changes back over. Nobody has oore \r
+ than two files open at the moment.\r
+\r
+Change 5578 on 2009/02/12 by jimi@jimi.jimi.antlr3\r
+\r
+ Correct the string template escape sequences for generating scope\r
+ code in the C templates.\r
+\r
+Change 5577 on 2009/02/12 by jimi@jimi.jimi.antlr3\r
+\r
+ C Runtime - Bug fixes.\r
+ \r
+ o Having moved to use an extract directly from a vector for returning \r
+ tokens, it exposed a\r
+ bug whereby the EOF boudary calculation in tokLT was incorrectly \r
+ checking > rather than\r
+ >=. \r
+ o Changing to API initialization of tokens rather than memcmp() \r
+ incorrectly forgot to \r
+ set teh input stream pointer for the manufactured tokens in the \r
+ token factory;\r
+ o Rewrite streams for rewriting tree parsers did not check whether the \r
+ rewrite stream\r
+ was ever assigned before trying to free it, it is now in line with \r
+ the ordinary parser code.\r
+\r
+Change 5567 on 2009/01/29 by jimi@jimi.jimi.antlr3\r
+\r
+ C Runtime - Further Optimizations\r
+ \r
+ Within grammars that used scopes and were intended to parse large \r
+ inputs with many rule nests,\r
+ the creation anf deletion of the scopes themselves became significant. \r
+ Careful analysis shows that\r
+ for most grammars, while a parse could create and delete 20,000 scopes, \r
+ the maxium depth of\r
+ any scope was only 8. \r
+ \r
+ This change therefore changes the scope implementation so that it does \r
+ not free scope memory when\r
+ it is popped but just tracks it in a C runtime stack, eventually \r
+ freeing it when the stack is freed. This change\r
+ caused the allocation of only 12 scope structures instead of 20,000 for \r
+ the extreme example case.\r
+ \r
+ This change means that scope users must be carefule (as ever in C) to \r
+ initializae their scope elements\r
+ correctly as:\r
+ \r
+ 1) If not you may inherit values from a prior use of the scope \r
+ structure;\r
+ 2) SCope structure are now allocated with malloc and not calloc;\r
+ \r
+ Also, when using a custom free function to clean a scope when it is \r
+ popped, it is probably a good idea\r
+ to set any free'd pointers to NULL (this is generally good C programmig \r
+ practice in any case)\r
+\r
+Change 5566 on 2009/01/29 by jimi@jimi.jimi.antlr3\r
+\r
+ Remove redundant BACKTRACK checking so that MSVC9 does not get confused \r
+ about possibly uninitialized variables\r
+\r
+Change 5565 on 2009/01/28 by jimi@jimi.jimi.antlr3\r
+\r
+ Use malloc rather than calloc to allocate memory for new scopes. Note \r
+ that this means users will have to be careful to initialize any values in their \r
+ scopes that they expect to be 0 or NULL and I must document this.\r
+\r
+Change 5564 on 2009/01/28 by jimi@jimi.jimi.antlr3\r
+\r
+ Use malloc rather than calloc for copying list lable tokens for \r
+ rewrites.\r
+\r
+Change 5561 on 2009/01/28 by jimi@jimi.jimi.antlr3\r
+\r
+ Prevent warnigsn about retval.stop not being initialized when a rule \r
+ returns eraly because it is in backtracking mode\r
+\r
+Change 5560 on 2009/01/28 by jimi@jimi.jimi.antlr3\r
+\r
+ Add a NULL check before freeing rewrite streams used in AST rewrites \r
+ rather than auto-rewrites.\r
+ \r
+ While the NULL check is redundant as the free cannot be called unless \r
+ it is assigned, Visual Studio C 2008\r
+ gets it wrong and thinks that there is a PATH than can arrive at the \r
+ free wihtout it being assigned and that is too annoying to ignore.\r
+\r
+Change 5559 on 2009/01/28 by jimi@jimi.jimi.antlr3\r
+\r
+ C target Tree rewrite optimization\r
+ \r
+ There is only one optimization in this change, but it is a huge one.\r
+ \r
+ The code generation templates were set up so that at the start of a rule,\r
+ any rewrite streams mentioned in the rule wer pre-created. However, this\r
+ is a massive overhead for rules where only one or two of the streams are\r
+ actually used, as we create them then free them without ever using them.\r
+ This was copied from the Java templates basically.\r
+ This caused literally millions of extra calls and vector allocations\r
+ in the case of the GNU C parser given to me for testing with a 20,000 \r
+ line program.\r
+ \r
+ After this change, the following comparison is avaiable against the gcc \r
+ compiler:\r
+ \r
+ Before (different machines here so use the relative difference for \r
+ comparison):\r
+ \r
+ gcc:\r
+ \r
+ real 0m0.425s\r
+ user 0m0.384s\r
+ sys 0m0.036s\r
+ \r
+ ANTLR C\r
+ real 0m1.958s\r
+ user 0m1.284s\r
+ sys 0m0.656s\r
+ \r
+ After the previous optimizations for vector pooling via a factory,\r
+ plus this huge win in removing redundant code, we have the following\r
+ (different machine to the one above):\r
+ \r
+ gcc:\r
+ 0.21user 0.01system 0:00.23elapsed 99%CPU (0avgtext+0avgdata 0maxresident)k\r
+ 0inputs+328outputs (0major+9922minor)pagefaults 0swaps\r
+ \r
+ ANTLR C:\r
+ \r
+ 0.37user 0.26system 0:00.64elapsed 99%CPU (0avgtext+0avgdata 0maxresident)k\r
+ 0inputs+0outputs (0major+130944minor)pagefaults 0swaps\r
+ \r
+ The extra system time coming from the fact that although the tree \r
+ rewriting is now optimal in terms of not allocating things it does \r
+ not need, there is still a lot more overhead in a parser that is generated \r
+ for generic use, including much more use of structures for tokens and extra \r
+ copying and so on. I will\r
+ continue to work on improviing things where I can, but the next big \r
+ improvement will come from Ter's optimization of the actual code structures we \r
+ generate including not doing things with rewrite streams that we do not need to \r
+ do at all.\r
+ \r
+ The second machine I used is about twice as fast CPU wise as the system \r
+ that was used originally by the user that asked about this performance.\r
+\r
+Change 5558 on 2009/01/28 by jimi@jimi.jimi.antlr3\r
+\r
+ Lots of optimizations (though the next one to be checked in is the huge \r
+ win) for AST building and vector factories.\r
+ \r
+ A large part of tree rewriting was the creation of vectors to hold AST \r
+ nodes. Although I had created a vector factory, for some reason I never got \r
+ around to creating a proper one, that pre-allocated the vectors in chunks and \r
+ so on. I guess I just forgot to. Hence a big win here is prevention of calling \r
+ malloc lots and lots of times to create vectors.\r
+ \r
+ A second inprovement was to change teh vector definition such that it \r
+ holds a certain number of elements wihtin the vector structure itself, rather \r
+ than malloc and freeing these. Currently this is set to 8, but may increase. \r
+ For AST construction, this is generally a big win because AST nodes don't often \r
+ have many individual children unless there has not been any shaping going on in \r
+ the parser. But if you are not shaping, then you don't really need a tree.\r
+ \r
+ Other perforamnce inprovements here include not calling functions \r
+ indirectly within token stream and common token stream. Hence tokens are \r
+ claimed directly from the vectors. Users can override these funcitons of course \r
+ and all this means is that if you override tokenstreams then you pretty much \r
+ have to provide all the mehtods, but then I think you woudl have to anyway (and \r
+ I don't know of anyone that has wanted to do this as you can carry your own \r
+ structure around with the tokens anyway and that is much easier).\r
+\r
+Change 5554 on 2009/01/26 by jimi@jimi.jimi.antlr3\r
+\r
+ Fixed: ANTLR-379\r
+ For some reason in the past, the ruleMemozation() template had required \r
+ that the name parameter be set to the rule name. This does not seem to be a \r
+ requirement any more. The name=xxx override when invoking the template was \r
+ causing all the scope names derived when cleaning up in memoization to be \r
+ called after the rule name, which was not correct. Howver, this only affected \r
+ the output when in output=AST mode.\r
+ \r
+ This template invocation is now corrected.\r
+\r
+Change 5553 on 2009/01/26 by jimi@jimi.jimi.antlr3\r
+\r
+ Fixed: ANTLR-330\r
+ Managed to get the one rule that could not see the ASTLabelType to call \r
+ back in to the super template C.stg and ask it to construct hte name. I am not \r
+ 100% sure that this fixes all cases, but I cannot find any that fail. PLease \r
+ let me know if you find any exampoles of being unable to default the \r
+ ASTLabelType option in the C target.\r
+\r
+Change 5552 on 2009/01/25 by jimi@jimi.jimi.antlr3\r
+\r
+ Progress: ANTLR-327\r
+ Fix debug code generation templates when output=AST such that code\r
+ can at least be generated and I can debug the output code correctly.\r
+ Note that this checkin does not implement the debugging requirements\r
+ for tree generating parsers.\r
+\r
+Change 5551 on 2009/01/25 by jimi@jimi.jimi.antlr3\r
+\r
+ Fixed: ANTLR-287\r
+ Most of the source files did not include the BSD license. THis might\r
+ not be that big a deal given that I don't care what people do with it\r
+ other than take my name off it, but having the license reproduced \r
+ everywhere at least makes things perfectly clear. Hence this mass change of \r
+ sources and templates to include the license.\r
+\r
+Change 5549 on 2009/01/25 by jimi@jimi.jimi.antlr3\r
+\r
+ Fixed: ANTLR-354\r
+ Using 0.0D as the default initialize value for a double caused\r
+ VS 2003 C compiler to bomb out. There seesm to be no reason other\r
+ than force of habit to set this to 0.0D so I have dropped the D so\r
+ that older compilers do not complain.\r
+\r
+Change 5547 on 2009/01/25 by jimi@jimi.jimi.antlr3\r
+\r
+ Fixed: ANTLR-282\r
+ All references are now unadorned with any type of NULL check for the \r
+ following reasons:\r
+ \r
+ 1) A NULL reference means that there is a problem with the \r
+ grammar and we need the program to fail immediately so \r
+ that the programmer can work out where the problem occured;\r
+ 2) Most of the time, the only sensible value that can be \r
+ returned is NULL or 0 which\r
+ obviates the NULL check in the first place;\r
+ 3) If we replace a NULL reference with some value such as 0, \r
+ then the program may blithely continue but just do something \r
+ logically wrong, which will be very difficult for the \r
+ grammar programmer to detect and correct.\r
+\r
+Change 5545 on 2009/01/24 by jimi@jimi.jimi.antlr3\r
+\r
+ Fixed: ANTLR-357\r
+ The bug report was correct in that the types of references to things\r
+ like $start were being incorrectly cast as they wer not changed from \r
+ Java style casts (and the casts are unneccessary). this is now fixed \r
+ and references are referencing the correct, uncast, types.\r
+ However, the bug report was wrong in that the reference in the bok to \r
+ $start.pos will only work for Java and really, it is incorrect in the \r
+ book because it shoudl not access the .pos member directly but shudl \r
+ be using $start.getCharPositionInLine().\r
+ Because there is no access qualification in C, one could use \r
+ $start.charPosition, however\r
+ really this should be $start->getCharPositionInLine($start);\r
+\r
+Change 5541 on 2009/01/24 by jimi@jimi.jimi.antlr3\r
+\r
+ Fixed - ANTLR-367\r
+ The code generation for the free method of a recognizer was not \r
+ distinguishing tree parsers from parsers when it came to calling delegate free \r
+ functions.\r
+ This is now corrected.\r
+\r
+Change 5540 on 2009/01/24 by jimi@jimi.jimi.antlr3\r
+\r
+ Fixed ANTLR-355\r
+ Ensure that we do not attempt to free any memory that we did not\r
+ actually allocate because the parser rule was being executed in\r
+ backtracking mode.\r
+\r
+Change 5539 on 2009/01/24 by jimi@jimi.jimivista.antlr3\r
+\r
+ Fixed: ANTLR-355\r
+ When a C targetted parser is producing in backtracking mode, then the \r
+ creation of new stream rewrite structures shoudl not happen if the rule is \r
+ currently backtracking\r
+\r
+Change 5502 on 2008/12/11 by jimi@jimi.jimi.antlr3\r
+\r
+ Fixed: ANTLR-349 Ensure that all marker labels in the lexer are 64 bit \r
+ compatible\r
+\r
+Change 5473 on 2008/12/01 by jimi@jimi.jimivista.antlr3\r
+\r
+ Fixed: ANTLR-350 - C runtime use of memcpy\r
+ Prior change to use memcpy instead of memmove in all cases missed the \r
+ fact that the string factory can be in a situation where overlaps occur. We now \r
+ have ANTLR3_MEMCPY and ANTLR3_MEMMOVE and use the two appropriately.\r
+\r
+Change 5387 on 2008/11/05 by parrt@parrt.spork\r
+\r
+ Fixed x+=. issue with tree grammars; added unit test\r
+\r
+Change 5325 on 2008/10/23 by parrt@parrt.spork\r
+\r
+ We were all ref'ing backtracking==0 hardcoded instead checking the \r
+ @synpredgate action.\r
+\r
+\r
Code Review / simantics / platform.git / blobdiff