Solving difficult LR parsing conflicts by postponing them
نویسندگان
چکیده
منابع مشابه
Solving difficult LR parsing conflicts by postponing them
Though yacc-like LR parser generators provide ways to solve shift-reduce conflicts using token precedences, no mechanisms are provided for the resolution of reduce-reduce conflicts. To solve this kind of conflicts the language designer has to modify the grammar. All the solutions for dealing with these difficult conflicts branch at each alternative, leading to the exploration of the whole searc...
متن کاملSolving Difficult Problems by Viewing them as Structured Dense Graphs
We are addressing the solving process over difficult AI problems such as planning and Boolean formula satisfaction in this paper. We propose a method for disentangling the structure of the problem hidden in its formulation. Namely we are viewing the problem as a graph with vertices end edges that we decompose into several complete sub graphs. The clique decomposition of the graph provides us wi...
متن کاملLR - parsing
LR-parsing Kyung-Goo Doh, Hyunha Kim, David A. Schmidt 1 Hanyang University, Ansan, South Korea 2 Kansas State University, Manhattan, Kansas, USA Abstract. We combine LR(k)-parsing technology and data-flow analysis to analyze, in advance of execution, the documents generated dynamically by a program. Based on the document language’s context-free reference grammar and the program’s control struc...
متن کاملPostponing Simple Conflicts in Nonlinear Planning
An important aspect of nonlinear planning is the resolution of conflicts between actions inserted into a plan. We present a technique for automatically deciding which conflicts should be resolved during planning, and which should be delayed until planning is otherwise complete. In particular we show that many potential conflicts can be provably delayed until the end; that is, if the planner can...
متن کاملLR-Parsing Derived
The LR(k)-parsing algorithm is derived, i.e., presented and proved as an interplay between program development and parsing theory. The program development uses invariants and the new concept of weakest angelic precondition. The parsing theory involved relates rightmost derivability to three other transitive relations on strings. The usual stack of item sets and the finite automaton appear in an...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computer Science and Information Systems
سال: 2011
ISSN: 1820-0214,2406-1018
DOI: 10.2298/csis101116008r