Consider a language which defines types according to the fol…

Consider a language which defines types according to the following grammar: –> int16 | int32 | int64 | struct { } –> ; | ε –> ID : A struct is a collection of fields. The type of a field could, in turn, be a struct that is defined inline. Here is an example of a type definition according to the grammar above: struct { A : int32; B : struct { X : int16; Y : int16; }; C : int64;} The alignment of a type is the largest power of 2 that is required to divide the memory addresses at which all instances of the type are placed. (For example, a type with 2-byte alignment must be placed at an even-numbered memory address, in bytes). int16, int32, and int64 are 16-bit, 32-bit, and 64-bit integers, respectively. In this language, integers require alignment equal to their size and the alignment of a struct is the maximum of the alignments of its fields. Construct an attribute grammar to compute the alignment of a .  Define attributes and state if each attribute is synthetic or inherited.  Write propagation rules for the attributes.  Use the format: ->  ==> .attribute1 = .attribute2  State how the parse tree should be traversed to evaluate the attributes.  Using the example declarations for a and b above, show the derivations and how attributes are propagated through the parse tree.  Use the format: 1. .attribute1 = .attribute2
Continue reading “Consider a language which defines types according to the fol…”…

Which of the following graph traversal techniques can be use…

Which of the following graph traversal techniques can be used to detect connected components in an undirected graph? Which of the following data structures is primarily used in the implementation of BFS? True or False: Dense graphs can be represented optimally using Adjacency List representation over Adjacency Matrix?
Continue reading “Which of the following graph traversal techniques can be use…”…