GATE CSE 1994 | Push Down Automata and Context Free Language Question 52 | 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.6

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.6

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

Theory of Computation

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

Operating Systems

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

Algorithms

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

Digital Logic

K Maps Boolean Algebra Combinational Circuits Number Systems Sequential Circuits

Database Management System

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

Data Structures

Trees Hashing Arrays Linked List Graphs Stacks and Queues

Computer Networks

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

Software Engineering

Compiler Design

Lexical Analysis Parsing Syntax Directed Translation Code Generation and Optimization

Web Technologies

General Aptitude

Numerical Ability Logical Reasoning Verbal Ability

Discrete Mathematics

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

Programming Languages

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

Computer Organization

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