GATE Overflow for GATE CSE - Recent questions tagged compiler-design
https://gateoverflow.in/tag/compiler-design
Powered by Question2AnswerAttributes in syntax directed translation
https://gateoverflow.in/389726/attributes-in-syntax-directed-translation
Attributes are said to be of two type, synthesised and inherited. What actually is an attribute? Why an attribute exist, how to define it?Compiler Designhttps://gateoverflow.in/389726/attributes-in-syntax-directed-translationMon, 28 Nov 2022 18:46:49 +0000#CompilerDesign #made-easy-test-series
https://gateoverflow.in/389712/%23compilerdesign-%23made-easy-test-series
<p style="text-align:center"><img alt="" src="https://gateoverflow.in/?qa=blob&qa_blobid=2435561984914968760"></p>
<p>what should be the ans??</p>
<p>according to me answer should be 7 nodes, 8 edges but 5 nodes, 6 edges is given in the answer key!</p>
<p>please tell me what am i doing wrong.</p>Compiler Designhttps://gateoverflow.in/389712/%23compilerdesign-%23made-easy-test-seriesMon, 28 Nov 2022 13:40:00 +0000Compiler Design self Doubt
https://gateoverflow.in/389340/compiler-design-self-doubt
"Every Regular Grammar has a Right linear grammar and this is LL(1)"<br />
<br />
What is meaning of this statement exactly and does it hold always?<br />
<br />
My Assumptions:<br />
<br />
If a grammar is right linear grammar then it can be parser by LL(1)<br />
<br />
->I am sure they are not left recursive.<br />
-->There definitely exist one unambiguous grammar for that right linear grammar.<br />
But this is not suffice to make grammar LL(1).<br />
<br />
Correct if I assumed anything wrong with some intutive answer.Compiler Designhttps://gateoverflow.in/389340/compiler-design-self-doubtFri, 25 Nov 2022 08:37:05 +0000gateforum
https://gateoverflow.in/389164/gateforum
<p><img alt="" src="https://gateoverflow.in/?qa=blob&qa_blobid=8874228925347101735"></p>Compiler Designhttps://gateoverflow.in/389164/gateforumTue, 22 Nov 2022 20:13:14 +0000gateforum
https://gateoverflow.in/388960/gateforum
<p><img alt="" src="https://gateoverflow.in/?qa=blob&qa_blobid=13629443447555425843"></p>Compiler Designhttps://gateoverflow.in/388960/gateforumSat, 19 Nov 2022 20:02:08 +0000Compiler principles Techniques and Tools
https://gateoverflow.in/388445/compiler-principles-techniques-and-tools
For sr 7,11- 1. i.Strings of 0's and 1's of the form aa', where a is binary string and a' is reverse of a.<br />
<br />
ii. Binary string of the form xy s.t. x!=y. Total length of xy is even, each of x and y be of odd lengthCompiler Designhttps://gateoverflow.in/388445/compiler-principles-techniques-and-toolsMon, 14 Nov 2022 18:06:02 +0000Construct unambiguous context-free grammars for each of the following languages. In each case show that your grammar is correct. Arithmetic expressions in postfix notation. Left-associative lists of identifiers separated by commas. Right-associative lists of identifiers separated by commas. Arithmetic expressions of integers and identifiers with the four binary operators +, -, *, /
https://gateoverflow.in/387395/associative-associative-identifiers-expressions-identifiers
Compiler Designhttps://gateoverflow.in/387395/associative-associative-identifiers-expressions-identifiersFri, 04 Nov 2022 13:01:47 +0000