Relay-Version: version B 2.10 5/3/83; site utzoo.UUCP
Path: utzoo!linus!decvax!tektronix!ogcvax!omsvax!icalqa!hplabs!sri-unix!PAZZANI@USC-ECL
From: PAZZANI%USC-ECL@sri-unix.UUCP
Newsgroups: net.ai
Subject: Parsifal
Message-ID: <11841@sri-arpa.UUCP>
Date: Mon, 19-Sep-83 11:58:00 EDT
Article-I.D.: sri-arpa.11841
Posted: Mon Sep 19 11:58:00 1983
Date-Received: Sun, 25-Sep-83 14:13:59 EDT
Lines: 25

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