PAZZANI%USC-ECL@sri-unix.UUCP (09/19/83)
I have a question about PARSIFAL (Marcus's deterministic parser) that
I hope someone can answer:
Is it easy (or possible) to convert grammar rules to the kind of rules
that Parsifal uses? Is there an algoritm to do so?
(i.e., by grammar rule, I mean things like:
S -> NP VP
VP -> VP2 NP PP
VP -> V3 INF
INF -> to VP
etc.
where by grammar rule Marcus means things like
{RULE MAJOR-DECL-S in SS-START
[=np][=verb]-->
Label c decl,major.
Deactivate ss-start. Activate parse-subj.}
{RULE UNMARKED-ORDER IN PARSE-SUBJ
[=np][=verb]-->
Attach 1st to c as np.
Deactivate Parse-subj. Activate parse-aux.}
Thanks in advance,
Mike Pazzani
Pazzani@usc-ecl