Explain parsing techniques, Computer Engineering

Assignment Help:

Explain any three parsing techniques.

Following are three parsing techniques:

Top-down parsing: This parsing can be viewed as an attempt to get left-most derivations of an input-stream through searching for parse trees by using a top-down expansion of the specified formal grammar rules. Tokens are used from left to right. Inclusive option is used to accommodate ambiguity through expanding all alternative right- hand-sides of grammar rules.

Bottom-up parsing: A parser can begin with the input and attempt to rewrite this to the start symbol. Instinctively, the parser attempts to place the most fundamental elements, then the elements having these, and so on. LR parsers are illustrations of bottom-up parsers. The other term used for this type parser is Shift-Reduce parsing.

Recursive descent parsing: This is a top down parsing without backtracking. This parsing technique utilizes a set of recursive processes to perform parsing. Salient features of recursive descent parsing are its generality and simplicity. This can be implemented in any language supporting recursive procedures.


Related Discussions:- Explain parsing techniques

Write policy of cache memory, Q. Write Policy of cache memory? If conte...

Q. Write Policy of cache memory? If contents of a block in cache are changed then it's essential to write it back to main memory before replacing it. Write policy determines wh

Determine the uses of memory blocks, Determine the Uses of memory blocks. ...

Determine the Uses of memory blocks. Not as common a technique though something to consider. As Verilog has a very convenient syntax for declaring and loading memories, you ca

Assembly langaauge microprocessor, write alp to perform bcd addition withou...

write alp to perform bcd addition without using procedure

Placement algorithm - process allocation, Placement algorithm - computer ar...

Placement algorithm - computer architecture: Different strategies can be taken as to how space is allocated to processes: First fit : Allocate the first hole that is la

Cg transformations, magnify a triangle a(0,0), b(1,1), c(5,2) twice its siz...

magnify a triangle a(0,0), b(1,1), c(5,2) twice its size hile keeping c as fix

Pre order given find post order ?, The preorder traversal sequence of a bin...

The preorder traversal sequence of a binary search tree is 30, 20, 10, 15, 25, 23, 39, 35, 42. Which one of the following is the postorder traversal sequence of the same tree?

Connector of conventional keyboard, 5-pin DIN connector: It is the conn...

5-pin DIN connector: It is the connector of conventional keyboard which have 5 pins (2 IN, 2 OUT and one ground pin) used for transfer and synchronization.

Binary resolution - artificial intelligence, Binary Resolution: We look...

Binary Resolution: We looked at unit resolution (a propositional inference law) in the last lecture: A ∨ B,   ¬B /A We may have this a bit further to propositional bin

What do you mean by polynomial and exponential bounds, What do you mean by ...

What do you mean by polynomial and exponential bounds?   Bounds of the form nc for c greater than 0 .such a bound are known as polynomial bounds. Bounds of the form 2(n )  .suc

Write Your Message!

Captcha
Free Assignment Quote

Assured A++ Grade

Get guaranteed satisfaction & time on delivery in every assignment order you paid with us! We ensure premium quality solution document along with free turntin report!

All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd