Advances in Ambiguity detection methods for formal grammars

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.