Computer Sciences > GATE 2024 SET-1 > Parsers

Contributed by: Dr. Sarah Chen

Report Correct Copyright Claim

Which of the following is/are Bottom-Up Parser(s)?

A

Shift-reduce Parser

B

Predictive Parser

C

LL(1) Parser

D

LR Parser

Check Answer

Explanation

Correct : a,d

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