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/data.h | 4 +++- 1 file changed, 3 insertions(+), 1 deletion(-) (limited to 'src/runtime/c/pgf/data.h') diff --git a/src/runtime/c/pgf/data.h b/src/runtime/c/pgf/data.h index 24ebbea32..1be7a3fcf 100644 --- a/src/runtime/c/pgf/data.h +++ b/src/runtime/c/pgf/data.h @@ -76,6 +76,7 @@ typedef struct { int arity; PgfEquations defns; // maybe null PgfExprProb ep; + void* predicate; } PgfAbsFun; extern GU_DECLARE_TYPE(PgfAbsFun, abstract); @@ -91,7 +92,8 @@ typedef struct { prob_t meta_token_prob; PgfMetaChildMap* meta_child_probs; - GuBuf* functions; // -->PgfFunDecl + GuBuf* functions; // -->PgfAbsFun + void* predicate; } PgfAbsCat; extern GU_DECLARE_TYPE(PgfAbsCat, abstract); -- cgit v1.2.3