Newsgroups: comp.ai.nat-lang
Path: cantaloupe.srv.cs.cmu.edu!europa.chnt.gtegsc.com!howland.reston.ans.net!cam.news.pipex.net!pipex!edi.news.pipex.net!pipex!uknet!newsfeed.ed.ac.uk!ainews!marks
From: marks@aisb.ed.ac.uk (Mark Stevenson)
Subject: Algorithm needed
Message-ID: <DB6s6x.7GH@aisb.ed.ac.uk>
Sender: news@aisb.ed.ac.uk (Network News Administrator)
Organization: Dept AI, Edinburgh University, Scotland
X-Newsreader: TIN [version 1.2 PL2]
Date: Tue, 4 Jul 1995 10:08:56 GMT
Lines: 11

I have been trying to work out an algorithm which takes a CFG grammar and a 
word and works out the first position in the sentence in which that word could
appear given the grammar. That is, for a grammar G we require the leftmost 
position where a word may appear in a string belonging to L(G).

I have tried to work out an algorithm myself but I have not managed to
get anything yet.

Any suggestions/pointers greatly appreciated.

Mark 
