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

What is a reference string, What is a reference string? An algorithm is...

What is a reference string? An algorithm is evaluated by running it on a exacting string of memory references and computing the number of page faults. The string of memory refe

Distinguish between complex type and simple type elements, Problem: (a)...

Problem: (a) (i) Distinguish between Complex Type and Simple Type elements. (ii) List two benefits while using XSDs in XML data modeling. (b) Both XML schema and XSL u

Advantages of random scan display, Advantages of random scan display ...

Advantages of random scan display Early computer displays: basically an oscilloscope. Control X, Y with vertical/horizontal plate voltage. Often used intensity as

Chains of inference, Chains of Inference: Now we have to look at how t...

Chains of Inference: Now we have to look at how to get an agent to prove a given theorem using various search strategies? Thus we have noted in previous lectures that, there i

Define syntax of mpi_bcast function, Q. Define syntax of MPI_Bcast function...

Q. Define syntax of MPI_Bcast function? MPI_Bcast(msgaddr, count, datatype, rank, comm):   This function is used by a process ranked rank in group comm to transmit messag

Goals and design principles, This is an applied unit that shows you how to ...

This is an applied unit that shows you how to assess interactive products against a selection of usability and user experience goals. It also introduces a selection of design princ

Determine what is the frame rate and frame duration, (i)  A multiplexer com...

(i)  A multiplexer combines four 100-Kbps channels using a time slot of 4 bits. Each Frame has the size of 16 bits. a)  Show the output with the four inputs as shown in the figu

Asp.net, in asp project is i have to crate database every time when i move ...

in asp project is i have to crate database every time when i move my project on different server

Rule in a single direction - equivalences rules, Rule in a single direction...

Rule in a single direction - equivalences rules: Hence there the power to replace  sub expressions always allows use to prove theorems with equivalences: as given in the above

Input-output-processor interconnection network (iopin), Input-Output-Proces...

Input-Output-Processor Interconnection Network (IOPIN) This interconnection network is used for communication between I/O channels and processors. All processors commune with a

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