Skip to main content
OverflowAI is here! AI power for your Stack Overflow for Teams knowledge community. Learn more

New answers tagged

1 vote

Attribute grammars: How are attributes implemented?

Broadly speaking, there are two approaches to implementing attribute grammars: Topological Sort A tool is used to analyze the definition of attributes and determine an evaluation order for them. This ...
Jeff Walker Code Ranger's user avatar
0 votes

What are quines (layman friendly)?

A fixed point is a solution $x$ to a fixed-point equation $x = f(x)$. The Kleene Recursion Theorem states that there is a Universal Recursive Function $f(P(φ),y)$ that includes every other recursive ...
NinjaDarth's user avatar
1 vote

(novice to compiler design) how does a recursive descent parser decide which nonterminal to parse if there are multiple

In practice, you do what needs doing to parse the text. If A and F didn't both start with "id", S would check which is the next token and then match the appropriate rule. In your case here, ...
gnasher729's user avatar
  • 30.4k
3 votes

(novice to compiler design) how does a recursive descent parser decide which nonterminal to parse if there are multiple

I'm assuming that you want to write a predictive parser, i.e. one that doesn't need to do any backtracking to parse the language. The languages parsed by predictive recursive descent parsers are ...
Knogger's user avatar
  • 1,072
1 vote

Understanding the concept of "Viable Prefixes"

there have been no attempts to answer your questions. Here is my attempt: (A) on the handle A rightmost handle refers to the substring within a right-sentential form that matches the right side of a ...
chrisoutwright's user avatar

Top 50 recent answers are included