1) Context free Grammar is ? A CompilerA language expressionA regular expressionNone of theseShow/Hide Answer Answer = BExplanation: Context free Grammar generate the context free languages. These are defined by the rule of the form A -> b Where A a non terminal and b is the string of terminals. 2) The idea of an automation with a stack as auxiliary storage... ? Finite automataPush down
No comments:
Post a Comment