I am looking for all possible ways to find and eliminate ambiguity in CF grammar. Please share your knowledge or opinion (preferably you will indicate the literature so that I can familiarize myself).I know that it is impossible to check whether the grammar is ambiguous and there is no 100% solution, but I need to consider all existing ways that can partially remove ambiguity. I know that ambiguity can generate chain rules. I also know that some constructions, for example S->SaS, generate ambiguity. P.S. sorry for my English. I am not a native speaker.

  • 1
    $\begingroup$ To check if a given grammar is ambiguous or not is an undecidable problem. $\endgroup$ Jan 30 at 9:07
  • $\begingroup$ I don't need a 100% solution to the problem. I need to find out all possible ways to determine that it is (or may be) ambiguous and, if possible, eliminate it. $\endgroup$
    – gendalin
    Jan 30 at 17:58
  • $\begingroup$ There is no list of all possible ways. For any list of possible ways, it is always possible to find another way that covers another ambiguous grammar not covered by any in the prior list. $\endgroup$
    – D.W.
    Jan 30 at 18:03
  • $\begingroup$ can you tell me the ways that you know?T hat's all I'm asking. $\endgroup$
    – gendalin
    Jan 30 at 18:14


Your Answer

By clicking “Post Your Answer”, you agree to our terms of service and acknowledge that you have read and understand our privacy policy and code of conduct.