5 years ago in UGC CS - December 2012

Which of the following is true while converting CFG to LL(I) grammar ?

[A] Remove left recursion alone
[B] Factoring grammar alone
[C] Both of the above
[D] None of the above
Loading...
Next Question

Overall Stats

Attempted 12
Correct 6
Incorrect 2
Viewed 4

Answers

Guest
Guest
Srusti Lingaraju
Srusti Lingaraju - 1 month ago

Srusti Lingaraju is saying Both of the above is correct answer

Raghuveer Dhakad
Raghuveer Dhakad - 2 years ago

Raghuveer Dhakad from Delhi, India is saying Both of the above is correct answer

Nazia Sayed
Nazia Sayed - 2 years ago

Nazia Sayed from Mumbai, India is saying Both of the above is correct answer

Sayed badruzama
Sayed badruzama - 2 years ago

Sayed badruzama from Mumbai, India is saying Both of the above is correct answer

sahezpreet singh
sahezpreet singh - 2 years ago

sahezpreet singh from Amritsar, India is saying Remove left recursion alone is correct answer

Related Questions

The design issue of Data Link Layer in OSI Reference Model is:

  • [A] Framing
  • [B] Representation of bits
  • [C] Synchronization of bits
  • [D] Connection Control

The GSM network is divided into the following three major systems:

  • [A] SS, BSS, OSS
  • [B] BSS, BSC, MSC
  • [C] CELL, BSC, OSS
  • [D] SS, CELL, MSC

The C Language is

  • [A] Context free language
  • [B] Context Sensitive Language
  • [C] Regular Language
  • [D] None of the above

The maturity levels used to measure a process are

  • [A] Initial, Repeatable, Defined, Managed, Optimized.
  • [B] Primary, Secondary, Defined, Managed, Optimized.
  • [C] Initial, Stating, Defined, Managed, Optimized.
  • [D] None of the above