Q. Which of the following statements are TRUE ?
I There exist parsing algorithms for some programming languages hose complex are less than θ(n 3 )

II A programming language which allows recursion can be implemented with static storage allocation

III No L-attributed definition can be evaluated in the framework of bottom-up parsing

IV Code improving transformations can be performed at both source language and intermediate code level

View solution

Q. What data structure in a complier is used for managing information about variables and their attributes?

View solution

Q. Which languages necessarily need heap allocation in the runtime environment?

View solution

Q. Given the language L-{ab, aa, baa}, which of the following strings are in LG?
1) abaabaaabaa

2) aaaabaaaa

3) baaaaabaaaab

4) baaaaabaa

View solution

Q. A simple two-pass assembler does which of the following in the first pass

View solution

Q. The lexical analyzer takes _________as input and produces a stream of _______as output.

View solution

Q. Task of the lexical analysis

View solution

Q. The output of lexical analyzer is a

View solution

Q. In a two pass assembler, adding literals to literal table and address resolution of local symbols are done using

View solution

Q. In Two pass assembler the object code generation is done during the

View solution

Q. Which of the following type of software should be used if you need to create, edit and print document?

View solution

Q. Output file of the Lex is _________ is the input file is Sam.

View solution

Q. Yacc is available as a command on the

View solution

Q. oading process can be divided into two programs. The first is binder the other is

View solution

Q. In Lex, a class is complemented by first placing

View solution

Q. Which of the following is not a feature of compiler?

View solution

Q. Predictive parsers can be

View solution

Q. An example of intermediate language is

View solution

Q. In a two pass assembler the object code generation is done during the

View solution

Q. A programming language is to be designed to run on a machine that does not have a big memory.

View solution