From 20aaa4a9899ce454d3c20594a2b7d2d3d38dbc88 Mon Sep 17 00:00:00 2001 From: "kr.angelov" Date: Fri, 14 Dec 2012 15:32:49 +0000 Subject: The first prototype for exhaustive generation in the C runtime. The trees are always listed in decreasing probability order. There is also an API for generation from Python --- src/runtime/c/pgf/parser.h | 5 ----- 1 file changed, 5 deletions(-) (limited to 'src/runtime/c/pgf/parser.h') diff --git a/src/runtime/c/pgf/parser.h b/src/runtime/c/pgf/parser.h index dcc3ca3af..6952d33ab 100644 --- a/src/runtime/c/pgf/parser.h +++ b/src/runtime/c/pgf/parser.h @@ -82,11 +82,6 @@ pgf_parser_add_literal(PgfConcr *concr, PgfCId cat, * @{ */ - -/// An enumeration of #PgfExpr elements. -typedef GuEnum PgfExprEnum; - - /// Retrieve the current parses from the parse state. PgfExprEnum* pgf_parse_result(PgfParseState* state, GuPool* pool); -- cgit v1.2.3