Alternative Method To Check Ambiguity In Context Free Grammars
Keywords:
Ambiguous grammar, Top-down parsing, Parse treeAbstract
Compilation of source code from different papers and books is a tedious and lengthy process. The result of the first phase of compilation, which is tokens, is given to the next phase called parsing which outputs a parse tree (also called syntax tree) to a grammar for a given input string. If there is more than one parse tree which are different with one another, then it calls the grammar as ambiguous grammar, or in short there exists an ambiguity in the grammar This paper tries to present an alternative method for checking the so called ambiguity problem in context free grammars by having an infix tree structure for a given input and comparing it with the corresponding parse trees and obtained from the given grammar in a top-down parsing approach
Downloads
Downloads
Published
How to Cite
Issue
Section
License
Thank you for your interest in submitting your manuscript to the Journal of Engineering and Technology (JET).
JET publishes only original works. Manuscripts must not be previously published or under consideration by any other publications. Papers published in JET may not be published again in whole or in part without permission. Please review these guidelines for researching, writing, formatting and submitting your manuscript. Authors retain copyright and grant the journal right of first publication with the work simultaneously licensed under a Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International (CC BY-NC-ND 4.0).
Those submitting manuscripts should be carefully checked to ensure that all works contributed to the manuscript are acknowledged. The list of authors should include all those who can legitimately claim authorship. Manuscript should only be submitted for consideration once consent is given by all contributing authors using Transfer of Copyright form.
