曖昧な文法
1. Ambiguous grammarIn computer science, a context-free grammar is said to be an ambiguous grammar if there exists a string that can be generated in more than one way (i.e. , the string admits more than one parse tree or, equivalently, more than one leftmost derivation). A context-free language is inherently ambiguous if all context-free grammars generating that language are ambiguous.
Read “Ambiguous grammar” on English Wikipedia
Read “曖昧な文法” on Japanese Wikipedia
Read “Ambiguous grammar” on DBpedia
Read “Ambiguous grammar” on English Wikipedia
Read “曖昧な文法” on Japanese Wikipedia
Read “Ambiguous grammar” on DBpedia
Discussions
Log in to talk about this word.