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

Differentiate between qa and testing, Differentiate between QA and testing....

Differentiate between QA and testing. - Quality Assurance is more a stop thing, ensuring quality in the company and thus the product rather than just testing the product for so

What is the window of the working set of a process, What is the window of t...

What is the window of the working set of a process? The window of the working set of a method is the total number in which the method had referred the set of pages in the work

What are font metrics classes, The FontMetrics class is used to describe im...

The FontMetrics class is used to describe implementation-specific properties, like ascent and descent, of a Font object.

Draw logic circuit for the simplified function, Minimize the logic function...

Minimize the logic function Y(A, B, C, D) = ∑m(0,1,2,3,5,7,8,9,11,14). Use  Karnaugh map. Draw logic circuit for the simplified function. Ans: In following figure (a) shows the

Graphics, what is bitmap and pixmap

what is bitmap and pixmap

Two - bit correlating predictor, The history file, history.txt, is the bran...

The history file, history.txt, is the branch history of a run of the gcc compiler (the first field is the address of the branch instruction, the second field is the target branch a

Instruction set and effective addressing techniques, The term addressing mo...

The term addressing mode is a technique of stating the input and output of an instruction; it is termed the effective address. There are 6 effective addresses in the 68HC11 set of

State about the internet services, State about the Internet services I...

State about the Internet services Internet services are provided automatically, in many other implementations the certificate is stored on a separate database or token such as

Explain loop-invariant code motion, Explain briefly Loop-invariant code ...

Explain briefly Loop-invariant code motion of the commonly used code optimization techniques. Loop-invariant code motion If a quantity is calculated inside a loop duri

Dna sequences, The dataset provided in this assignment contains a collectio...

The dataset provided in this assignment contains a collection of real DNA sequences. The number of true binding sites is quite limited and that makes the problem challenging. In ma

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