πŸŽ“ Computer Science & Engineering Portal

Master Engineering Disciplines with Structured Notes

Comprehensive academic lecture notes, exam-oriented unit summaries, laboratory manuals, and previous year question papers designed strictly for university students.

πŸ“‘

University Syllabi

AKTU & AICTE aligned semester guidelines.

πŸ“

Exam Question Papers

Previous 5 years solved university papers.

πŸ’‘

Lab Manuals & Viva

Practical codes with outputs & interview Qs.

Core Subjects & Units Hub

Click on any specific unit to immediately view its lecture notes below

Viewing All Lectures

Shift reduce parsing

Shift reduce parsing

  • Shift reduce parsing is a process of reducing a string to the start symbol of a grammar.
  • Shift reduce parsing uses a stack to hold the grammar and an input tape to hold the string.

Shift reduce parsing

  • Sift reduce parsing performs the two actions: shift and reduce. That's why it is known as shift reduces parsing.
  • At the shift action, the current symbol in the input string is pushed to a stack.
  • At each reduction, the symbols will replaced by the non-terminals. The symbol is the right side of the production and non-terminal is the left side of the production.

Example:

Grammar:

S β†’ S+S    
S β†’ S-S    
S β†’ (S)  
S β†’ a

Input string:

a1-(a2+a3)  

Parsing table:


Shift reduce parsing 1

There are two main categories of shift reduce parsing as follows:

  1. Operator-Precedence Parsing
  2. LR-Parser

Labels: ,

Discussion & Queries (<$I18NNumComments$>):

<$CommentPager$>
<$I18NAtCommentTimeWithPermalink$>, <$I18NCommentAuthorSaid$>

<$BlogCommentBody$>

<$BlogCommentDeleteIcon$>
<$CommentPager$>