Conversion of Ambiguous Grammar to Unambiguous Grammar using Parse Tree
Kuldeep B. Vayadande, Prithviraj Sangle, Kunjal Agrawal, Atman Naik, Aslaan Mulla, Ayushi Khare · 2023
The approach described in this research study uses parse trees to transform ambiguous syntax into unambiguous grammar. There is no algorithm that can detect whether a grammar is ambiguous or not. The steps that will be considered in the proposed system to convert an ambiguous grammar into unambiguous are: Precedence of operators and the Associativity rule. Multiple interpretations of a statement might result from ambiguous grammar, making it challenging for natural language processing systems to recognize and respond to the intended meaning. The proposed approach entails creating a parse tree for the input text and utilizing it to locate and eliminate ambiguity sources. Experiments on a dataset of phrases with unclear syntax are used to assess the method's efficacy, indicating the potential for enhanced performance in natural language processing systems.