From d553cb165a5dd02c8d27e88a196e0e6b15cf389b Mon Sep 17 00:00:00 2001 From: "kr.angelov" Date: Tue, 25 Jun 2013 19:22:42 +0000 Subject: 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. --- src/runtime/c/pgf/pgf.c | 1 + 1 file changed, 1 insertion(+) (limited to 'src/runtime/c/pgf/pgf.c') 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; -- cgit v1.2.3