woutput@ji.Berkeley.EDU (Andrew Purshottam) (05/12/87)
Has anyone seen anything about techniques for speeding up the parsing of prolog DCG's? In particular, it seems to me that one could often put an atom in the nonterminal's clause head, if one knew (as one often does, for artificial languages at least), the FIRST+ set for that nonterminal. (Often this set has only one element, or a few, and the rule could be repeated for each). Thus one would get an "LL(1) with backtrack" grammar (compiler folks please excuse oxymoron), which might run a lot faster under prologs with first arg hashing. Any pointers/code would be appreciated. Please mail straight to me, I shall summarize if people are interested. Cheers, Andy ...!ucbvax!woutput woutput@ji.berkeley.edu (cond ((lovep you (quote LISP)) (honk)) (t (return ()))) Cheers, Andy ..!ucbvax!woutput woutput@ji.berkeley.edu (cond ((lovep you (quote LISP)) (honk)) (t (return ())))