Register

compiler doubt

428 views

1 Answer

Best answer
2 votes
2 votes
  1. To make the stack directly accessible to the semantic routines. Using this approach, the action routines take their parameters from the top of the stack rather than receiving them explicitly when they are called. Similarly, any semantic record produced by an action routine is pushed onto the stack after the parameters are removed. It is called an Action-Controlled Semantic Stack.
  2. it is mainly used in semantic routines
• selected by
User Avatar
Voting & Accepting an answer helps improve the community
← PreviousNext →
← Previous in categoryNext in category →

Related questions

0 votes
0 votes
1 answer
1
Hirak asked Jun 1, 2019
2,113 views
Compiler design Self doubt
S → aSbS /bSaS / ϵ S → aABb A→ c/ ϵ B → d/ ϵ Which of the following is LL1. Explain in details.
S → aSbS /bSaS / ϵS → aABb A→ c/ ϵ B → d/ ϵWhich of the following is LL1. Explain in details.
User Avatar
0 votes
0 votes
1 answer
2
Ebrahim asked Jan 31
150 views
compiler design tcompiler-design-timothy-g-griffin
6. Generate code for the following C program using any code generation algorithm. [3 Marks] main() { int x, a, b, c, d, e; x= a + b -( c + d ) * e }
6. Generate code for the following C program using any code generation algorithm. [3 Marks] main() { int x, a, b, c, d, e; ...
User Avatar
0 votes
0 votes
1 answer
3
Ebrahim asked Jan 12
175 views
Compiler-design
Q1. For the following grammar N -> AB | BA A -> a | CAC B -> b | CBC C -> a | b Find the FIRST and FOLLOW
Q1. For the following grammar N - AB | BA A - a | CAC B - b | CBC C - a | b Find the FIRST and FOLLOW
User Avatar
0 votes
0 votes
0 answers
4
Ebrahim asked Jan 11
109 views
compiler-design-timothy-g-griffin
Find the FIRST and FOLLOW of the grammar to check whether it is LL (1) parser or not. N → AB | BA A → a | CAC B → b | CBC C → a | b
Find the FIRST and FOLLOW of the grammar to check whether it is LL (1) parser or not. N → AB | BA A → a | CAC B → b | CBC C → a | b
User Avatar
Link Copied!