S && L Attributes

The inter-dependencies among synthesized and inherited attributes at nodes in parse tree is depicted using_______.

• Dependency graph

• Directed Acyclic graph

• Interdependency graph

• Wait for Graph

Consider node for production T-->T1*F , so the T.val at this node defined by

• T.val:=T1.val*F1.val

• T.val:=T1.val*F1.val

• T.val: =T1.val*F. val

• T.val: =T.val*F. val

Translation scheme with left recursive grammar for production E->E1+T is

• E.val:=E1.val+T.val

• E.val:=E.val + T.val

• Both a and b

• None of these

L-attributed definitions include all syntax directed definitions of

• LL(1) grammar

• LK(1) grammar

• LR(0) grammar

• Both a & c

------------------ syntax for mknode is:

• mknode (op ,left)

• mknode (id ,left ,right)

• mknode (op ,right)

• mknode (op ,left ,right)

-------------syntax of mkleaf is:

• mkleaf (id , num)

• mkleaf (num , val)

• mkleaf (id , entry)

• Both b & c

In an L-attributed SDD , attributes may be inherited or synthesized.

• True

• False

Terminals can have synthesized attributes but not inherited attributes.

• True

• False

---------------- are useful tool for determining an evaluation order for the attribute instances in given parse tree.

• DAG

• Dependency graph

• Graph coloring graph

• None of these

A parse tree for ----------------- can be always annotated by evaluating semantic rules for attributes at each node bottom-up.

• S-attributed definition

• Inherited attributes

• Both a and b

• Syntax directed definition