Article Categories
- All Categories
-
Data Structure
-
Networking
-
RDBMS
-
Operating System
-
Java
-
MS Excel
-
iOS
-
HTML
-
CSS
-
Android
-
Python
-
C Programming
-
C++
-
C#
-
MongoDB
-
MySQL
-
Javascript
-
PHP
Computer Programming Articles
Page 6 of 18
What is role of Run-time Storage Management in compiler design?
The compiler demands a block of memory for the operating system. The compiler utilizes this block of memory executing the compiled program. This block of memory is called storage management. One of the important tasks that a compiler must perform is to allocate the resources of the target machine to represent the data objects that are being manipulated by the source program.A compiler must decide the runtime representation of the data objects in the source program. In the source program, runtime representations of the data objects, such as integers and real variables, usually take the form of equivalent data objects ...
Read MoreWhat is two array representations in the symbol table?
Symbol Table is a data structure that supports an effective and efficient way of storing information about various names appearing in the source program. These names are used in the source code to identify the different program elements, like a variable, constants, procedures, and the labels of statements.The symbol table is searched each time a name is encountered in the source text. When a new name or new data about an existing name is found, the content of the symbol table modifies.Therefore, the symbol table must have an efficient mechanism for accessing the data held in the table also for ...
Read MoreVerifying whether the string id * id + id is accepted by a given grammar using SLR parsing\\nConsider the SLR parsing table for the Grammar\\nE → E + T\\nE → T\\nT → T ∗ F\\nT → F\\nF → (E)\\nF → id\\nCheck whether the string id * id + id is accepted or not by using the SLR parsing table constructed in the example.
Problem Statement Verifying whether the string id * id + id is accepted by a given grammar using SLR parsingConsider the SLR parsing table for the GrammarE → E + TE → TT → T ∗ FT → FF → (E)F → idCheck whether the string id * id + id is accepted or not by using the SLR parsing table constructed in the example. SolutionInitially, LR Parser in state 0.Put $ at the end of the string, i.e., id * id + id $.StackInput StringReason0id ∗ ...
Read MoreWhat is an Activation Record?
An Activation Record is a data structure that is activated/ created when a procedure/function is invoked, and it includes the following data about the function.Activation Record in 'C' language consist ofActual ParametersNumber of ArgumentsReturn AddressReturn ValueOld Stack Pointer (SP)Local Data in a function or procedureHere, Old SP stores the value of stack pointer of Activation Record of procedure which has called this procedure which leads to the generation of this Activation Record, i.e., It is a pointer to the activation record of the caller.In Stack Allocation Scheme, when procedure A calls Procedure B, the activation record for B will be ...
Read MoreWhat are Lists and Self-Organizing lists in compiler design?
ListsIt is conceptually simplest and easy to implement a data structure for the symbol table in a linear list of records, as shown below −It can use an individual array to store the name and its associated information. New Names are inserted to the list in the order in which they are encountered. It can retrieve data about a name we search from the starting of the array up to the position marked by the pointer AVAILABLE which indicates the beginning of the empty portion of the array.When the name is placed, the associated data can be discovered in the ...
Read MoreWhat is Search Tree and Hash Tables in compiler design?
Search TreeA more effective technique to symbol table organization is to add two link fields, LEFT and RIGHT, to every record. We use these fields to link the records into a binary search tree.This tree has the property that all names NAME (j) accessible from NAME (i) by following the link LEFT (i) and then following any sequence of links will precede NAME (i) in alphabetical order (symbolically, NAME (j) < NAME (i))Similarly, all names NAME (k) accessible starting with RIGHT (i) will have the property that NAME (i) < NAME (k). Thus, if we are searching for NAME and ...
Read MoreHow are access links and displays used to access non-local names?
An access link is a pointer to each activation record that obtains a direct implementation of lexical scope for nested procedures. In other words, an access link is used to implement lexically scoped language. An “access line” can be required to place data required by the called procedure.An improved scheme for handling static links defined at various lexical levels is the usage of a data structure called display. A display is an array of pointers to the activation records. Display [0] contains a pointer to the activation record of the most recent activation of a procedure defined at lexical level ...
Read MoreWhat is Types of Representative Scope Information?
Representing scope information is a concept in which the scope of each variable name is preserved in the symbol table so that we can use the same name in different blocks and different locations. Representing name in symbol table along with an indicator of the block in which it appears.Suppose we have a variable name 'a' in block A and the same variable in block B. Suppose it can store 'a' in the symbol table without block information. In that case, it will only keep the first instance of 'a' which it encounters, hence to overcome this problem names are ...
Read MoreWhat is Representing Scope Information?
Representing scope information is a concept in which the scope of each variable name is preserved in the symbol table so that we can use the same name in different blocks and different locations.Representing Scope Information involvesA lifetime of a variable in a particular block.Representing name in symbol table along with an indicator of the block in which it appears.Suppose we have a variable name 'a' in block A and the same variable in block B. Suppose we store 'a' in symbol table without block information. In that se, it will only keep the first instance of 'a' which it ...
Read MoreWhat is role of different data structures in compiler design?
During compilation, the symbol table is searched each time an identifier is encountered. Data are added if a new name or new information about an existing name is find. Thus, in designing a symbol table structure, it would like a scheme that enables us to insert new entries and identify current entries in a table effectively.There are four symbol tables used in a data structure which are as follows −Lists− The simplest and clear to implement a data structure for a symbol is the linear list of records as displayed in the figure.It can use a single array or several ...
Read More