Computer Sciences > Gate 2015 Set-1 > Parsing

Contributed by: Dr. Sarah Chen

Report Correct Copyright Claim

Which one of the following is True at any valid state in shift-reduce parsing?

A

Viable prefixes appear only at the bottom of the stack and not inside

B

Viable prefixes appear only at the top of the stack and not inside

C

The stack contains only a set of viable prefixes

D

The stack never contains viable prefixes

Check Answer

Explanation

Correct : Parsing

Similar Questions

What is the worst-case time complexity of insertion in an AVL tree?

Question #23 Medium

Which operations on a binary search tree have O(h) complexity?

Question #31 Easy

Compare search complexities of sorted array vs balanced BST.

Question #47 Hard

Related Topics

Data Structures Binary Search Tree Time Complexity Algorithm Analysis Tree Algorithms Computer Science