Characterization of extended LR( k) grammars

A formal characterization of ELR(k) grammars is given after presenting some necessary definitions and notation and information characterization of ELR(k) grammars. Its correctness is proved according to the definition of ELR(k) grammars, which is based on the derivation forms of grammars. Then, ELAL...

Full description

Saved in:
Bibliographic Details
Published in:Information processing letters 1997-10, Vol.64 (2), p.75-82
Main Authors: Lee, Gyung-Ok, Kim, Do-Hyung
Format: Article
Language:English
Subjects:
Applied sciences
Automata. Abstract machines. Turing machines
Automation
Compilers
Computer science
control theory
systems
ELALR( k) grammars
ELR( k) grammars
Exact sciences and technology
Extended context-free grammars
Finite state automata
Formal languages
Information processing
Language theory and syntactical analysis
Languages
Studies
Theoretical computing
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:A formal characterization of ELR(k) grammars is given after presenting some necessary definitions and notation and information characterization of ELR(k) grammars. Its correctness is proved according to the definition of ELR(k) grammars, which is based on the derivation forms of grammars. Then, ELALR(k) grammars are formally characterized using the characterization of ELR(k) grammars. Another possible approach or viewpoint to the problem tackled is also addressed.
ISSN:0020-0190
1872-6119
DOI:10.1016/S0020-0190(97)00152-X