GATE CSE 1994 | Push Down Automata and Context Free Language Question 60 | Theory of Computation

PREVIOUS NEXT

GATE CSE 1994

MCQ (Single Correct Answer)

-0.6

Which of the following features cannot be captured by context-free grammars?

Syntax of if-then-else statements

Syntax of recursive procedures

Whether a variable has been declared before its use

Variable names of arbitrary length

GATE CSE 1992

MCQ (More than One Correct Answer)

-0

Context-free languages are

closed under union

closed under complementation

closed under intersection

closed under Kleene closure.

GATE CSE 1989

MCQ (More than One Correct Answer)

-0

Context free languages and regular languages are both closed under the operation(s) of :

Union

Intersection

Concatenation

Complementation

GATE CSE 1987

MCQ (Single Correct Answer)

-0.6

FORTRAN is:

Regular language.

Context free language.

Context sensitive language.

None-of the above.

PREVIOUS NEXT

GATE CSE Subjects

Browse all chapters by subject

Theory of Computation

Finite Automata and Regular Language Push Down Automata and Context Free Language Undecidability Recursively Enumerable Language and Turing Machine

Operating Systems

Process Concepts and Cpu Scheduling Synchronization and Concurrency Deadlocks Memory Management File System IO and Protection

Algorithms

Greedy Method Complexity Analysis and Asymptotic Notations Dynamic Programming Divide and Conquer Method Searching and Sorting P and NP Concepts

Digital Logic

Boolean Algebra K Maps Combinational Circuits Number Systems Sequential Circuits

Database Management System

Er Diagrams Functional Dependencies and Normalization Structured Query Language Relational Algebra Transactions and Concurrency File Structures and Indexing

Data Structures

Arrays Stacks and Queues Linked List Trees Graphs Hashing

Computer Networks

Concepts of Layering Data Link Layer and Switching Network Layer Application Layer Protocol Routing Algorithm TCP UDP Sockets and Congestion Control Lan Technologies and Wi-Fi Network Security

Software Engineering

Compiler Design

Lexical Analysis Parsing Syntax Directed Translation Code Generation and Optimization

Web Technologies

General Aptitude

Verbal Ability Logical Reasoning Numerical Ability

Discrete Mathematics

Set Theory & Algebra Linear Algebra Graph Theory Combinatorics Mathematical Logic Probability Calculus

Programming Languages

Function and Recursion Basic of Programming Language Pointer and Structure in C

Computer Organization

Computer Arithmetic Pipelining Machine Instructions and Addressing Modes Memory Interfacing IO Interface Alu Data Path and Control Unit Secondary Memory