diff options
| author | kr.angelov <kr.angelov@gmail.com> | 2013-06-25 19:22:42 +0000 |
|---|---|---|
| committer | kr.angelov <kr.angelov@gmail.com> | 2013-06-25 19:22:42 +0000 |
| commit | d553cb165a5dd02c8d27e88a196e0e6b15cf389b (patch) | |
| tree | 1cf3a7c5387422f23bb89c2fe623ab436e6aec2b /src/runtime/c/pgf/pgf.c | |
| parent | 09a42bbab0bc0d19cd7bd85f8b3705316c8b4038 (diff) | |
Now there is a just-in-time compiler which generates native code for proof 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.
Diffstat (limited to 'src/runtime/c/pgf/pgf.c')
| -rw-r--r-- | src/runtime/c/pgf/pgf.c | 1 |
1 files changed, 1 insertions, 0 deletions
diff --git a/src/runtime/c/pgf/pgf.c b/src/runtime/c/pgf/pgf.c index 81b1fa05c..f1b85cae3 100644 --- a/src/runtime/c/pgf/pgf.c +++ b/src/runtime/c/pgf/pgf.c @@ -30,6 +30,7 @@ pgf_read(const char* fpath, PgfReader* rdr = pgf_new_reader(in, pool, tmp_pool, err); PgfPGF* pgf = pgf_read_pgf(rdr); + pgf_reader_done(rdr, pgf); gu_pool_free(tmp_pool); return pgf; |