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

Double negation, Double Negation : All parents are forever correcting ...

Double Negation : All parents are forever correcting their children for the find of double negatives,  there we have to be very alert with them in natural language like: "He d

Which layer is not present in TCP/IP model, Which Layer is not present in T...

Which Layer is not present in TCP/IP model? Presentation layer is not present into Transfer Control Protocol/IP Model.

Explain about the public key cryptography, Explain about the Public Key Cry...

Explain about the Public Key Cryptography. Public Key Cryptography: It is a cryptographic system which uses two keys as a public key identified to everyone and a private

State and prove demorgan’s first theorems, State and prove Demorgan’s First...

State and prove Demorgan’s First theorems: Ans. Statement of First Theorem of De Morgan: = A‾. B‾   Proof: The two sides of the equation i.e. = is represented with logic

Compare a decoder and a demultiplexer with block diagram, Compare a decoder...

Compare a decoder and a demultiplexer with suitable block diagrams. Ans. Demultiplexer has similar circuit as decoder but here e is obtained as the particular input line, the

What are the concerns for growth of e-commerce in india, What are the conce...

What are the concerns for growth of e-commerce in India?  Government as Facilitator for the growth of e-commerce has taken certain steps: Promotion of competitive teleco

What is difference between cobol and vs cobol ii, In using COBOL on PC we h...

In using COBOL on PC we have only flat files and the programs can access only limited storage, while in VS COBOL II on M/F the programs can access up to 16MB or 2GB depending on th

Can we run dot.net in unix platform, Can we run DOT.NET in UNIX platform? ...

Can we run DOT.NET in UNIX platform? One of the drawbacks of using Visual Studio.NET and the .NET framework to develop applications has been the lack of cross-platform support

What types of calendars can you create with google calendar, What types of ...

What types of calendars can you create with Google Calendar? Personal calendars, like default calendar Public calendars, which others can access through the web

Find 9''s compliment of bcd number using 4-bit binary adder, Design a circu...

Design a circuit for determining the 9's compliment of a BCD number by using 4-bit binary adder and some external logic gates? Compliment of a BCD number 9's co

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