UGC NET CSE | December 2012 | Part 2 | Question: 35

Which of the following is true while converting CFG to an LL(1) grammar?Removing left recursion aloneFactoring the grammar aloneRemoving left recursion and factoring the ...

Arjun

5.9k views

Arjun asked Jul 10, 2016

Compiler Design
ugcnetcse-dec2012-paper2
compiler-design
parsing

+ –

2 votes

5 answers

go_editor asked Jul 8, 2016

1,987 views

UGC NET CSE | December 2012 | Part 2 | Question: 18
Given the following expressions of a grammar $E \rightarrow E * F / F + E / F$ $F \rightarrow F – F / id$ Which of the following is true? $*$ has the higher precedence than + - has the higher precedence than $*$ + and – have same precedence + has the higher precedence than $*$

Given the following expressions of a grammar$E \rightarrow E * F / F + E / F$$F \rightarrow F – F / id$Which of the following is true?$*$ has the higher precedence ...

go_editor

2.0k views

go_editor asked Jul 8, 2016

Compiler Design
ugcnetcse-dec2012-paper2
compiler-design
parsing

+ –

1 votes

1 answer

Sanjay Sharma asked Jun 1, 2016

4,103 views

UGC NET CSE | December 2012 | Part 2 | Question: 11
In compiler design ‘reducing the strength’ refers to reducing the range of values of input variables code optimization using cheaper machine instructions reducing efficiency of program none of the above

In compiler design ‘reducing the strength’ refers toreducing the range of values of input variablescode optimization using cheaper machine instructionsreducin...

Sanjay Sharma

4.1k views

Sanjay Sharma asked Jun 1, 2016

Compiler Design
code-optimization
ugcnetcse-dec2012-paper2
compiler-design

+ –

2 votes

2 answers

go_editor asked Jul 11, 2016

4,650 views

UGC NET CSE | December 2012 | Part 2 | Question: 44
Let L be set accepted by a non-deterministic finite automaton. The number of states in non-deterministic finite automaton is $\mid Q \mid$. The maximum number of states in equivalent finite automaton that accepts L is $\mid Q \mid$ $ 2 \mid Q \mid$ $2^{\mid Q \mid} -1$ $2^{\mid Q \mid}$

Let L be set accepted by a non-deterministic finite automaton. The number of states in non-deterministic finite automaton is $\mid Q \mid$. The maximum number of states ...

go_editor

4.7k views

go_editor asked Jul 11, 2016

Theory of Computation
ugcnetcse-dec2012-paper2
theory-of-computation
finite-automata

+ –

tags	tag:apple
author	user:martin
title	title:apple
content	content:apple
exclude	-tag:apple
force match	+apple
views	views:100
score	score:10
answers	answers:2
is accepted	isaccepted:true
is closed	isclosed:true

0 reply

Please log in or register to add a comment.

Please log in or register to answer this question.

3 Answers

0 reply

Please log in or register to add a comment.

0 reply

Please log in or register to add a comment.

0 reply

Please log in or register to add a comment.

Related questions

0

0

0

0