Compiler Design 2 min read
CONSTRUCTING SLR(1) PARSING TABLE
To perform SLR parsing, take grammar as input and do the following: 1. Find LR(0) items. 2. Completing the closure. 3. Compute goto(I,X),…
THE ARTICLE LIBRARY
All stories.
Ideas and explainers from across SenseCentral.
Compiler Design 3 min read
Error Recovery
A parser should be able to detect and report any error in the program. It is expected that when an…
Compiler Design 3 min read
LR PARSERS
An efficient bottom-up syntax analysis technique that can be used CFG is called LR(k) parsing. The ‘L’ is for left-to-right…
Compiler Design 5 min read
BOTTOM-UP PARSING
Constructing a parse tree for an input string beginning at the leaves and going towards the root is called bottom-up…
Compiler Design 6 min read
TOP-DOWN PARSING
It can be viewed as an attempt to find a left-most derivation for an input string or an attempt to…
Compiler Design 3 min read
WRITING A GRAMMAR
A grammar consists of a number of productions. Each production has an abstract symbol called a nonterminal as its left-hand side, and a sequence of one…
Compiler Design 3 min read
Context-Free GRAMMARS
A Context-Free Grammar is a quadruple that consists of terminals,non-terminals, start symbol and productions. Terminals: These are the basic symbols from which strings are formed. Non-Terminals: These…
Compiler Design 3 min read
Error Handling in Compiler Design
The tasks of the Error Handling process are to detect each error, report it to the user, and then make some recover…
Compiler Design 1 min read
Types of Parsing
Syntax analyzers follow production rules defined by means of context-free grammar. The way the production rules are implemented (derivation) divides…
Compiler Design 2 min read
THE ROLE OF PARSER
The parser or syntactic analyzer obtains a string of tokens from the lexical analyzer and verifies that the string can…