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

Convert ascii code to its bcd equivalent, Convert ASCII code to its BCD equ...

Convert ASCII code to its BCD equivalent. This can be achieved by simply replacing bits in upper four bits of byte by four zeros. For illustration the ASCII '1' is 32h = 0010B. By

Declarative programming languages, Declarative programming languages: ...

Declarative programming languages: We notice that declarative programming languages can have some better compensation over procedural ones. Actually, it is often said that a J

Enumerate about the decimal arithmetic unit, Enumerate about the Decimal Ar...

Enumerate about the Decimal Arithmetic Unit The user of the computer input data in decimal numbers and receives output in the decimal form. But a CPU with ALU can perform arith

Doubly linked list, A doubly linked list is like a linked list except that ...

A doubly linked list is like a linked list except that each node has a pointer both to the next node in the list and to the previous node in the list. There are also pointers to th

Computer Architecture, As an advocate of CISC architecture to RISC architec...

As an advocate of CISC architecture to RISC architecture, what are the merits and demerits of CISC to RISC architecture

Weight training calculations - artificial intelligence, Weight Training Cal...

Weight Training Calculations -Artificial intelligence: Because we have more weights in our network than in perceptrons, first we have to introduce the notation: wij to denote t

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

What start bit and stop bit, What start bit and stop bit The first bit ...

What start bit and stop bit The first bit known as the Start bit is always a zero and it is used to show the beginning of the character The last bit is known as the stop bit

Board coloring, In this problem you are given a board in which some of the...

In this problem you are given a board in which some of the elements are placed as shown in diagram below. Each element represents a color. Fill the other elements in the board, 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