| Age | Commit message (Collapse) | Author |
|
|
|
|
|
|
|
|
|
|
|
for the other CPUs
|
|
little benefit
|
|
|
|
|
|
for Android is temporary disabled
|
|
the dependency on the ./configure script
|
|
|
|
|
|
|
|
|
|
|
|
category for every expression
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
changes in the printer
|
|
trees and types. This includes dependent types, high-order abstract syntax and implicit arguments
|
|
it is implicitly kept in the JIT compiled code
|
|
|
|
|
|
|
|
|
|
|
|
|
|
search. This is already used by the exhaustive generator. The time to generate 10000 abstract trees with ParseEng went down from 4.43 sec to 0.29 sec.
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
one for the output trees. This means that the memory for parsing can be released as soon as the needed abstract trees are retrieved, while the trees themselves are retained in the separate output pool
|
|
|
|
partial trees
|
|
using readline with word completion
|
|
|
|
|