A theory of automatic language acquisition
Source: OAI
0 Reads
  • Source
    • "After certain derivations, the method stops expanding. It may be due to the reason that it terminates the recursive grammars (Cheung, 1994). But this does not always happen. "
    [Show abstract] [Hide abstract]
    ABSTRACT: Problem arising in CFG (Context Free Grammar) due to ambiguity can be trace to 1962. Even now there is no general method or procedure introduced to detect ambiguity in CFG. In parser generation and in language design, ambiguity in context free grammar, is a frequent problem as well as in application where it is used for the representation of physical structure. For creating a language it should be necessary that it is unambiguous. Ambiguity has some advantages as well as disadvantages. The aim of this study is to analyze different methods dealing with the ambiguity detection in Context Free Grammars. In this study, we will observe usefulness of Ambiguity Detection Method (ADM) in CFG with respect to ambiguity detection, assurance of termination of the process and accuracy.
    Research Journal of Applied Sciences, Engineering and Technology 01/2014; 7(22).
  • [Show abstract] [Hide abstract]
    ABSTRACT: One way to verifying a grammar is the detection of ambiguity. Unfortunately, ambiguity problem for context-free grammars is undecidable. Ambiguity in context-free grammars is a recurring problem in language design and parser generation, as well as in applications where grammars are used as models of real-world physical structures. Context-free grammars are widely used but still hindered by ambiguity. We observe that there is simple linguistic characterization of the grammar ambiguity problem .This problem divided into form of horizontal and vertical ambiguity. We show the conservative approximation for ambiguity problem. The proposed methodology have implemented in Java.

Similar Publications