In formal language theory, what distinguishes a context-free grammar from a context-sensitive grammar?

💡 Explanation

A context-free grammar's production rules apply regardless of the surrounding symbols, whereas context-sensitive grammar rules depend on the neighboring context; because of this dependency, context-sensitive grammars are more powerful. Therefore, context defines the key difference, rather than the simplicity, generation, or expression.

• Which outcome occurs when a context-free grammar (CFG) is used to define a formal language with inherently ambiguous structures?
• Which outcome occurs when a decision tree's 'information gain' metric favors splitting on attributes with numerous values, leading to overfitting on a manufacturing defect dataset?
• In programmable logic controllers (PLCs), if a sensor's boolean output indicates 'NOT (A AND B)', which equivalent expression allows simplified ladder logic implementation?
• A user wishes to prove they know a secret to a remote server without revealing the secret itself. Which mechanism confirms knowledge without disclosure?
• Which mechanism allows context-free grammars to parse structured text formats with nested dependencies in compilers?
• If a sender increases the size of the prime numbers *p* and *q* used to generate the modulus *n* in an RSA cryptosystem, which consequence follows?