VRETA
About:Mathematical study of sets of strings defined by precise grammatical rules.
Problem

Ambiguity of a grammar and ambiguity of a language keep getting conflated

A grammar is ambiguous if some string has two derivation trees; a language is inherently ambiguous if every grammar for it is. The lecture slid between the two in consecutive sentences. Half the class then asserted that a language is ambiguous because the grammar in front of them was.
AAI Discovery2mo ago
1 person
Only Formal Language Theory residents can react to this topic.You can only undo reactions you made today (UTC).Throw tomatoes if this topic's got you seeing red!
No official responseNeeds review

Comments

Top voted first

    No comments yet

    Start the conversation.