operator precedence parsing

OPERATOR PRECEDENCE PARSER

A grammar G is said to be operator precedence if it possess following properties:
  1. No production on the right side is Ɛ.
  2. There should not be any production rule possessing 2 adjacent non terminals at the right hand side. 
Consider the grammar for arithmetic expression
E→ EAE | (E) | -E | id 
A → + | * | / | - | ^

This grammar is not an operator precedent grammar as in the production rule

E → EAE

It contains 2 consecutive non terminals. Hence we first convert it into equivalent operator precedence grammar by removing A.

E → E+E | E*E | E/E | E-E | E^E

E → (E) | -E | id 
In Operator precedence parsing we first define precedence relations <· = and ·> between pair of terminals. The meaning of these relations is 
  1. p <· q means p gives more precedence than q.
  2. p ·> q means p takes precedence over q. 
  3. p=q means has same precedence as q. 
Advantages of operator precedence parsing 
1. This type of parsing is simple to implement. 
2. Operator precedence parser is the only parser which can parse ambiguous grammar also. 

Disadvantages of operator precedence parsing 
1. This type of parsing can be applicable for only small class of grammars. 

Application 
The operator precedence parsing is done in a language having operators. Hence in SNOBOL operator precedence parsing is done.
Python Programming ↓ 👆
Java Programming ↓ 👆
JAVA EasyExamNotes.com covered following topics in these notes.
JAVA Programs
Principles of Programming Languages ↓ 👆
Principles of Programming Languages
EasyExamNotes.com covered following topics in these notes.

Practicals:
Previous years solved papers:
A list of Video lectures References:
  1. Sebesta,”Concept of programming Language”, Pearson Edu 
  2. Louden, “Programming Languages: Principles & Practices” , Cengage Learning 
  3. Tucker, “Programming Languages: Principles and paradigms “, Tata McGraw –Hill. 
  4. E Horowitz, "Programming Languages", 2nd Edition, Addison Wesley

    Computer Organization and Architecture ↓ 👆

    Computer Organization and Architecture 

    EasyExamNotes.com covered following topics in these notes.

    1. Structure of desktop computers
    2. Logic gates
    3. Register organization
    4. Bus structure
    5. Addressing modes
    6. Register transfer language
    7. Direct mapping numericals
    8. Register in Assembly Language Programming
    9. Arrays in Assembly Language Programming

    References:

    1. William stalling ,“Computer Architecture and Organization” PHI
    2. Morris Mano , “Computer System Organization ”PHI

    Computer Network ↓ 👆
    Computer Network

    EasyExamNotes.com covered following topics in these notes.
    1. Data Link Layer
    2. Framing
    3. Byte count framing method
    4. Flag bytes with byte stuffing framing method
    5. Flag bits with bit stuffing framing method
    6. Physical layer coding violations framing method
    7. Error control in data link layer
    8. Stop and Wait scheme
    9. Sliding Window Protocol
    10. One bit sliding window protocol
    11. A protocol Using Go-Back-N
    12. Selective repeat protocol
    13. Application layer
    References:
    1. Andrew S. Tanenbaum, David J. Wetherall, “Computer Networks” Pearson Education.
    2. Douglas E Comer, “Internetworking with TCP/IP Principles, Protocols, And Architecture",Pearson Education
    3. KavehPahlavan, Prashant Krishnamurthy, “Networking Fundamentals”, Wiley Publication.
    4. Ying-Dar Lin, Ren-Hung Hwang, Fred Baker, “Computer Networks: An Open Source Approach”, McGraw Hill.