Solving Difficult LR Parsing Conflicts by Postponing Them.

Saved in:

Bibliographic Details
Title:	Solving Difficult LR Parsing Conflicts by Postponing Them.
Authors:	Rodriguez-Leon, C.¹ casiano@ull.es, Garcia-Forte, L.¹ lgforte@ull.es
Source:	Computer Science & Information Systems. May2011, Vol. 8 Issue 2, p517-531. 15p. 3 Black and White Photographs.
Subjects:	Programming languages, Sublanguage, Grammar, Semantics, Computer engineering
Abstract:	The article presents the Postponed Conflict Resolution (PPCR) strategy to extend the Yet Another Compiler-Compiler (yacc) conflict resolution sublanguage. It mentions that the extensions supply means to resolve any type of conflicts, such as those that can not be figured out with the use of static precedences. It states that the method also makes feasible the analyzing of grammars whose ambiguity needs to be solved in terms of the semantic context.
Database:	Engineering Source

Description
Abstract:	The article presents the Postponed Conflict Resolution (PPCR) strategy to extend the Yet Another Compiler-Compiler (yacc) conflict resolution sublanguage. It mentions that the extensions supply means to resolve any type of conflicts, such as those that can not be figured out with the use of static precedences. It states that the method also makes feasible the analyzing of grammars whose ambiguity needs to be solved in terms of the semantic context.
ISSN:	18200214
DOI:	10.2298/CSIS101116008R