Hear you get Quizzes and Practice Tests, Study Materials, Exam Notifications
Context-free grammar can be used to specify both lexical and syntax rules.
Type checking is done before parsing.
High-level language programs can be translated to different Intermediate Representations.
Arguments to a function can be passed using the program stack.
closed under complementation
closed under intersection
a subset of the set of all recursive languages
an uncountable set