By Topic

Language specification by multi-axiom grammars

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Rus, T. ; Dept. of Comput. Sci., Iowa Univ., Iowa City, IA, USA ; Le Peau, J.P.

Multiaxiom grammars and language, presented as generalizations of context-free grammars and languages, are defined and used as a mechanism for programming language specification and implementation. It is shown how to divide such a grammar into a sequence of subgrammars that generate inductively the language specified by the original grammar. Furthermore, it is shown how to use this sequence of subgrammars for inductive language recognition by a process of tokenizing. Two classes of algorithms for languages parsing based on multi-axiom grammars are developed: an algorithm obtained by generalizing context-free LR-parsers to multi-axiom grammars, and a pattern-matching algorithm that results from the ability to layer a multi-axiom language into levels such that each sublanguage is independent of the language that contains it. The implications of multi-axiom grammars for compiler code generation are briefly discussed.<>

Published in:

Computer Languages, 1988. Proceedings., International Conference on

Date of Conference:

9-13 Oct. 1988