Syntax-Directed Definitions (SDDs) without side effects are also known as:
An SDD that specifies values purely through mathematical equations without procedural side-effects (like printing or updating global tables) is called an Attribute Grammar.
Suppose an L-attributed grammar is parsed using a top-down predictive parser. How are inherited attributes passed to recursive functions?
In top-down predictive parsers, inherited attributes pass down as input parameters to the parsing procedure for a non-terminal, while synthesized attributes are returned by the procedure.
Which of the following problems can be solved using Syntax Directed Translation?
SDTs are widely used for type checking, abstract syntax tree construction, and intermediate code generation during parsing.
In the context of SDD evaluation, what does a 'Topological Sort' of a dependency graph guarantee?
Topological sorting of an acyclic directed graph provides a linear ordering of vertices such that for every directed edge u -> v, node u is processed before node v.
In a Syntax-Directed Translation, side-effects such as 'print(E.val)' or 'insert_symboltable()' are known as:
Procedural semantic actions perform arbitrary code side-effects (like I/O or symbol table updates) rather than simply defining mathematical attribute values.