Skip Navigation

The Computer Journal 1974 17(3):242-244; doi:10.1093/comjnl/17.3.242
© 1974 by British Computer Society
This Article
Right arrow Full Text (PDF)
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Email this article to a friend
Right arrow Similar articles in this journal
Right arrow Similar articles in ISI Web of Science
Right arrow Alert me to new issues of the journal
Right arrow Add to My Personal Archive
Right arrow Download to citation manager
Right arrow Search for citing articles in:
ISI Web of Science (1)
Right arrowRequest Permissions
Google Scholar
Right arrow Articles by Komor, T.
Right arrow Search for Related Content
Social Bookmarking
Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

A note on left factored languages

T. Komor *

INFELOR Systems Engineering Institute, Budapest, Hungary

In the papers of Wood (1969, 1970) left factored (LF) grammars and languages are defined. In this paper we show that Lemma 8 in Wood (1970) does not hold, and therefore the proof of Lemma 6 is incorrect. We prove a theorem which gives a necessary and sufficient condition for an unambiguous grammar to be an LF grammar. On the basis of the theorem we give an example of a language, which can be used in the proof of Lemma 6. In Section 5 we give an extension to Foster's SID (see Foster, 1968), which transforms context-free grammars to LF form.

Received September 1972.

* INFELOR Systems Engineering Institute, 1281 Budapest, P.O.B. 10, Hungary


Add to CiteULike CiteULike   Add to Connotea Connotea   Add to Del.icio.us Del.icio.us    What's this?




Disclaimer:
Please note that abstracts for content published before 1996 were created through digital scanning and may therefore not exactly replicate the text of the original print issues. All efforts have been made to ensure accuracy, but the Publisher will not be held responsible for any remaining inaccuracies. If you require any further clarification, please contact our Customer Services Department.