Advances in Ambiguity detection methods for formal grammars

Hari Mohan Pandey*

*Corresponding author for this work

Research output: Contribution to journalConference proceeding article (ISSN)peer-review

5 Citations (Scopus)


In the area of computer science and others grammars play a vital role from both theoretical and practical points of view. The application areas of formal grammars is increasing day by day in various areas such as patter recognition, machine learning, computational biology, robotics and control systems, speech recognition systems, inductive logic programming and other. Context free grammars, one of the four classes of grammars as defined by Noam Chomsky have wide variety of application. Primarily, Context Free Grammar used to build compilers to verify the syntax of computer program. However, it is known that making research in this field is a computationally hard nut to crack. This paper mainly explores the language model presented by Comosky, Problem of Ambiguity, Degree of Ambiguity, Approaches to Detect Ambiguity, comparisons of existing methods and recent trends etc.

Original languageEnglish
Pages (from-to)700-707
Number of pages8
JournalProcedia Engineering
Publication statusPublished - 1 Dec 2011
Event2011 International Conference on Advances in Engineering, ICAE 2011 - Nanjing, China
Duration: 24 Dec 201125 Dec 2011


  • Ambiguity
  • Context free grammars
  • Harmless productions
  • Horizontal and vertical Ambiguity
  • Non-canonical test


Dive into the research topics of 'Advances in Ambiguity detection methods for formal grammars'. Together they form a unique fingerprint.

Cite this