Title: Conflict Resolution in LALR PARSER


Volume 2 Issue 1 Year 2012

Authors:

Mukesh Kumar Gupta

mukeshgupta@skit.ac.in
Department of Computer Science, Swami Keshvanand Institute of Technology, Management & Gramothan, Jaipur (INDIA),

S.R. Dogiwal

ijskit@skit.ac.in
Department of Computer Science, Swami Keshvanand Institute of Technology, Management & Gramothan, Jaipur (INDIA),

Anjali Kedawat

ijskit@skit.ac.in
Department of Computer Science, Swami Keshvanand Institute of Technology, Management & Gramothan, Jaipur (INDIA)

Pages: 1-7


Abstract:

Basically there are two type of conflicts occured in LALR parsers: shift/reduce and reduce/reduce parsers. But the problem of reduce/reduce conflicts are still not be solved completely. In this paper, we proposed a method to resolve the above said problems and applied the proposed methods on various examples.

Keywords:
conflicts, parsers, lookhead