Aspire Faculty ID #18801 · Topic: UGC NET Computer Science Sep 2022 (Paper II) · Just now
UGC NET Computer Science Sep 2022 (Paper II)

Consider the following statements:

Statement I: LALR parser is more powerful than canonical LR Parser.

Statement II: SLR parser is more powerful than LALR.

Which of the following is correct?

Solution

The power hierarchy of LR parsers is:

$SLR < LALR < Canonical\ LR$

Now check Statement I:

Statement I says that LALR parser is more powerful than canonical LR Parser.

But actually Canonical LR parser is more powerful than LALR parser.

So, Statement I is false.

Now check Statement II:

Statement II says that SLR parser is more powerful than LALR.

But actually LALR parser is more powerful than SLR parser.

So, Statement II is false.

Therefore, both Statement I and Statement II are false.

Previous 10 Questions — UGC NET Computer Science Sep 2022 (Paper II)

Nearest first
1
A top down approach to programming calls for:Statement I: Working from the general to the specific.Statement II: Postpo…
Topic: UGC NET Computer Science Sep 2022 (Paper II)
2
Consider the following statements:Statement I: Composite attributes cannot be divided into smaller subparts.Statement I…
Topic: UGC NET Computer Science Sep 2022 (Paper II)
3
Consider the following statements:Statement I: Conservative 2 PL is a deadlock-free protocol.Statement II: Thomas's wri…
Topic: UGC NET Computer Science Sep 2022 (Paper II)
4
Consider the following statements of approximation algorithm:Statement I: Vertex-cover is a polynomial time 2-approxima…
Topic: UGC NET Computer Science Sep 2022 (Paper II)
5
Consider the following:List IList II(A) Stack algorithm(I) Deadlock(B) Elevator algorithm(II) Disk scheduling(C) Priori…
Topic: UGC NET Computer Science Sep 2022 (Paper II)
6
Consider the following algorithms and their running times:List IList II(A) Breadth First Search(I) $\theta(V+E)$(B) Rab…
Topic: UGC NET Computer Science Sep 2022 (Paper II)
7
Match List I with List II:List IList II(A) Physical layer(I) Routing of the signals, divide the outgoing message into p…
Topic: UGC NET Computer Science Sep 2022 (Paper II)
8
Match List I with List II:List IList II(A) BIND(I) Block the caller until a connection attempt arrives(B) LISTEN(II) Gi…
Topic: UGC NET Computer Science Sep 2022 (Paper II)
9
Match List I with List II:List IList II(A) DES(I) Key size - 256(B) AES(II) Key size - 1024(C) 3 DES(III) Key size - 56…
Topic: UGC NET Computer Science Sep 2022 (Paper II)
10
Match List I with List II:List IList II(A) Firmware(I) Number of logical records into physical blocks(B) Batch file(II)…
Topic: UGC NET Computer Science Sep 2022 (Paper II)

Next 10 Questions — UGC NET Computer Science Sep 2022 (Paper II)

Ascending by ID
Ask Your Question or Put Your Review.

loading...