Epsilon weak precedence grammars and languages

DOI10.1051/ITA/1990240302411zbMATH Open0701.68066OpenAlexW1542531156MaRDI QIDQ3479532FDOQ3479532

Authors: Masoud T. Milani, David A. Workman 

Publication date: 1990

Published in: RAIRO - Theoretical Informatics and Applications (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/92358

Recommendations

• Some properties of precedence languages
• On the descriptive power of simple precedence grammars
• A class of grammars of right weak precession (RWP)
• Properties of deterministic top down grammars
• Beyond operator-precedence grammars and languages

zbMATH Keywords

deterministic context-free languagesprecedence grammars

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Grammars and rewriting systems (68Q42)

Cites Work

• EULER: A generalization of ALGOL and its formal definition: Part 1
• Notes on top-down languages
• Optimization of LR(k) parsers
• On the translation of languages from left to right
• Strict deterministic grammars
• Bounded context syntactic analysis
• Some properties of precedence languages
• Title not available (Why is that?)
• A hierarchy of deterministic languages
• A technique for generating almost optimal Floyd-Evans productions for precedence grammars
• Weak and Mixed Strategy Precedence Parsing
• An Iteration Theorem for Simple Precedence Languages

Cited In (2)

• On the descriptive power of simple precedence grammars
• A class of grammars of right weak precession (RWP)

Uses Software

• Euler

This page was built for publication: Epsilon weak precedence grammars and languages

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3479532)