Chapter 10 Programming Language Concepts R Sebesta

Nama: Stefanus Eduard Adrian
NIM: 1801382963

Kali ini saya akan menjawab Assignment #10 dari Chapter 10 Programming Language Concepts R Sebesta

Review Questions

6. What is the difference between an activation record and an activation record instance?

*An activation record is the format, or layout, of the moncode part of a subprogram. An activation record instance is a concrete example of an activation record, a collection of data in the form of an activation record.

7. Why are the return address, dynamic link, and parameters placed in the bottom of the activation record?

*It's because the entry must appear first.

8. What kind of machines often use registers to pass parameters?

*RISC Machines often use registers to pass parameters.

9. What are the two steps in locating a nonlocal variable in a static-scoped language with stack-dynamic local variables and nested subprograms?

*First step, find correct activation record (the harder part) and then the second step is determine the offset within that activation record (easy part).

10. Define static chain, static_depth, nesting_depth, and chain_offset.

*Static chain is chain of static links connecting an activation record to all of it's static ancestors (it's enclosing subprograms).

Static depth is depth of the nesting for each enclosing static scope.

Nesting depth is the difference between the static depth of the reference and that of the scope where it was declared.

Chain offset is same as nesting depth.

Problem Set

6. Although local variables in Java methods are dynamically allocated at the beginning of each activation, under what circumstances could the value of a local variable in a particular activation retain the value of the previous activation?

*Each activation allocates variables in exactly the same order. Variables are not initialized to any value unless the program contains an initialization statement for the variable – they simply have whatever value is stored in the location they are allocated. If a procedure finishes executing, returns, and is immediately reinvoked, a variable would be assigned the same stack location it had on the previous invocation, and would have the last value from that previous invocation.

7. It is stated in this chapter that when nonlocal variables are accessed in a dynamic-scoped language using the dynamic chain, variable names must be stored in the activation records with the values. If this were actually done, every nonlocal access would require a sequence of costly string comparisons on names. Design an alternative to these string comparisons that would be faster.

*Using approach that uses an auxiliary data structure called a display. Or, to write variable names as integers. These integers act like an array. So when the activation happens, the comparisons will be faster.

8. Pascal allows gotos with nonlocal targets. How could such statements be handled if static chains were used for nonlocal variable access? Hint: Consider the way the correct activation record instance of the static parent of a newly enacted procedure is found (see Section 10.4.2).

*Based on the hint statement, the target of every goto in a program could be represented as an address and a nesting depth, where the nesting depth is the difference between the nesting level of the procedure that contains the goto and that of the procedure containing the target. Then, when a goto is executed, the static chain is followed by the number of links indicated in the nesting depth of the goto target. The stack top pointer is reset to the top of the activation record at the end of the chain.

9. The static-chain method could be expanded slightly by using two static links in each activation record instance where the second points to the static grandparent activation record instance. How would this approach affect the time required for subprogram linkage and nonlocal references?

*Including two static links would reduce the access time to nonlocals that are defined in scopes two steps away to be equal to that for nonlocals that are one step away. Overall, because most nonlocal references are relatively close, this could significantly increase the execution efficiency of many programs.

10. Design a skeletal program and a calling sequence that results in an activation record instance in which the static and dynamic links point to different activation-recorded instances in the run-time stack.

*\\

\emph{Answer}:\\

procedure Main\_2 is\\

\verb+    + X : Integer;\\

\verb+    +procedure Bigsub is\\

\verb+    +\verb+    +    A, B, C : Integer;\\

\verb+    +\verb+    +    procedure Sub1 is\\

\verb+    +\verb+    +\verb+    +    A, D : Integer;\\

\verb+    +\verb+    +\verb+    +    begin -- of Sub1\\

\verb+    +\verb+    +\verb+    +    A := B + C; $\longleftarrow$ 1\\

\verb+    +\verb+    +\verb+    +      ...\\

\verb+    +    end; -- of Sub1\\

\verb+    +    procedure Sub2(X : Integer) is\\

\verb+    +\verb+    +      B, E : Integer;\\

\verb+    +\verb+    +      procedure Sub3 is\\

\verb+    +\verb+    +\verb+    +        C, E : Integer;\\

\verb+    +\verb+    +\verb+    +        begin -- of Sub3\\

\verb+    +\verb+    +\verb+    +        ...\\

\verb+    +\verb+    +\verb+    +        Sub1;\\

\verb+    +\verb+    +\verb+    +        ...\\

\verb+    +\verb+    +\verb+    +        E := B + A; $\longleftarrow$ 2\\

\verb+    +\verb+    +      end; -- of Sub3\\

\verb+    +\verb+    +      begin -- of Sub2\\

\verb+    +\verb+    +      ...\\

\verb+    +\verb+    +      Sub3;\\

\verb+    +\verb+    +      ...\\

\verb+    +\verb+    +      A := D + E; $\longleftarrow$ 3\\

\verb+    +    end; -- of Sub2\\

\verb+    +    begin -- of Bigsub\\

\verb+    +\verb+    +    ...\\

\verb+    +\verb+    +    Sub2(7);\\

\verb+    +\verb+    +    ...\\

\verb+    +  end; -- of Bigsub\\

  begin -- of Main\_2\\

\verb+    +  ...\\

\verb+    +  Bigsub;\\

\verb+    +  ...\\

end; -- of Main\_2\\

\\

The sequence of procedure calls is:\\

Main\_2 calls Bigsub\\

Bigsub calls Sub2\\

Sub2 calls Sub3\\

Sub3 calls Sub1\\

\\

The activation records with static and dynamic links is as follows:\\

\begin{figure}

\centering

\includegraphics[scale=0.5]{ari}

\end{figure}

At position 1 in procedure Sub1, the reference is to the local variable,

A, not to the nonlocal variable A from Bigsub. This reference to A has the

chain\_offset/local\_offset pair (0, 3). The reference to B is to the nonlocal B

from Bigsub. It can be represented by the pair (1, 4). The local\_offset is 4,

because a 3 offset would be the first local variable (Bigsub has no parameters). Notice that if the dynamic link were used to do a simple search for

an activation record instance with a declaration for the variable B, it would

find the variable B declared in Sub2, which would be incorrect. If the (1, 4)

pair were used with the dynamic chain, the variable E from Sub3 would be

used. The static link, however, points to the activation record for Bigsub,

which has the correct version of B . The variable B in Sub2 is not in the

referencing environment at this point and is (correctly) not accessible. The

reference to C at point 1 is to the C defined in Bigsub, which is represented

by the pair (1, 5).\\

\\

\noindent

Chapter 9 Programming Language Concepts R Sebesta

Nama: Stefanus Eduard Adrian
NIM: 1801382963

Kali ini saya akan menjawab Assignment #9 dari Chapter 9 Programming Language Concepts R Sebesta

Review Questions

6. What is a Ruby array formal parameter?

*Ruby supports a complicated but highly flexible actual parameter configuration. The initial parameters are expressions, whose value objects are passed to the corresponding formal parameters. The initial parameters can be following by a list of key => value pairs, which are placed in an anonymous hash and a reference to that hash is passed to the next formal parameter. These are used as a substitute for keyword parameters, which Ruby does not support. The hash item can be followed by a single parameter preceded by an asterisk. This parameter is called the array formal parameter.

7. What is a parameter profile? What is a subprogram protocol?

*Parameter profile is the number, order, and types of its formal parameters.

Subprogram protocol is its parameter profile plus, if it is a function, its return type. In languages in which subprograms have types, those types are defined by the subprogram’s protocol.

8. What are formal parameters? What are actual parameters?

*Formal parameters are the parameters in the subprogram header.

Actual parameters are a list of parameters to be bound to the formal parameters of the subprogram which must be included with the name of the subprogram by the subprogram call statements.

9. What are the advantages and disadvantages of keyword parameters?

*The advantage of keyword parameters is that they can appear in any order in the actual parameter list. The disadvantage to keyword parameters is that the user of the subprogram must know the names of formal parameters.

10. What are the differences between a function and a procedure?

*A function returns value but procedures do not. Function are structurally resemble procedures but are semantically modeled on mathematical parameter.

Problem Set

6. Present one argument against providing both static and dynamic local variables in subprograms.

*In subprograms local variables can be static or dynamic;

If local variable treated statically:

This allows for compile-time allocation/ deallocation and ensures proper type checking but does not allow for recursion.

And if local variables treated dynamically:

This allows for recursion at the cost of run-time allocation/ deallocation and initialization because these are stored on a stack, referencing is indirect based on stack position and possibly time-consuming.

7. Consider the following program written in C syntax:

void fun (int first, int second) { 

first += first;

second += second;

}

void main() { 

int list[2] = {1, 3}; 

fun(list[0], list[1]);

}

For each of the following parameter-passing methods, what are the values of the list array after execution?

a. Passed by value                       : 1,3

b. Passed by reference                 : 2,6

c. Passed by value-result             : 2,6

8. Argue against the C design of providing only function subprograms.

*If a language provides only functions, then either programmers must live with the restriction of returning only a single result from any subprogram, or functions must allow side effects, which is generally considered bad. Since having subprograms that can only modify a single value is too restrictive, C’s choice is not good.

9. From a textbook on Fortran, learn the syntax and semantics of statement functions. Justify their existence in Fortran.

* The Fortran 1966 standard provided a reference syntax and semantics, but vendors continued to provide incompatible extensions. These standards have improved portability.

10. Study the methods of user-defined operator overloading in C++ and Ada, and write a report comparing the two using our criteria for evaluating languages.

* One of the nice features of C++ is that you can give special meanings to operators, when they are used with user-defined classes. This is called operator overloading. You can implement C++ operator overloads by providing special member-functions on your classes that follow a particular naming convention. For example, to overload the + operator for your class, you would provide a member-function named operator+ on your class.

Meanwhile for Ada, since much of the power of the language comes from its extensibility, and since proper use of that extensibility requires that we make as little distinction as possible between predefined and user-defined types, it is natural that Ada also permits new operations to be defined, by declaring new overloadings of the operator symbols.

Chapter 8 Programming Language Concepts R Sebesta

Nama: Stefanus Eduard Adrian
NIM: 1801382963

Kali ini saya akan menjawab Assignment #8 dari Chapter 8 Programming Language Concepts R Sebesta

Review Questions

6. What is unusual about Python’s design of compound statements?

*Python uses indentation to specify compound statements. For example,

if x > y :

x = y

print “case 1″

equally indent statements are grouped as one compound statement.

7. Under what circumstances must an F# selector have an else clause?

*If the expression returns a value, it must have an else clause.

8. What are the common solutions to the nesting problem for two-way selectors?

*The common solution is to force an alternative semantics, by using compound statements.

9. What are the design issues for multiple-selection statements?

*-What is the form and type of the control statement?

-How are the selectable segments specified?

-Is execution flow through the structure restricted to include just a single selectable segment?

-How are case values specified?

-What is done about unrepresented expression values?

10. Between what two language characteristics is a trade-off made when deciding whether more than one selectable segment is executed in one execution of a multiple selection statement?

*In Ada, the choice lists of the case statement must be exhaustive, so that there can be no unrepresented values in the control expression. In C++, unrepresented values can be caught at run time with the default selector. If there is no default, an unrepresented value causes the whole statement to be skipped.

Problem Set

6. Analyze the potential readability problems with using closure reserved words for control statements that are the reverse of the corresponding initial reserved words, such as the case-esac reserved words of ALGOL 68. For example, consider common typing errors such as transposing characters.

*The potential readability problem is the typing errors. It’s very possible to occur if we don’t type the code carefully.

7. Use the Science Citation Index to find an article that refers to Knuth (1974). Read the article and Knuth’s paper and write a paper that summarizes both sides of the goto issue.

*An alternative viewpoint is presented in Donald Knuth's Structured Programming with go to Statements, which analyzes many common programming tasks and finds that in some of them GOTO is the optimal language construct to use.[7] In their quasi-standard book on the C programming language, Dennis Ritchie and Brian Kernighan warn that goto is "infinitely abusable", but also suggest that it could be used for end-of-function error handlers and for multi-level breaks from loops.

8. In his paper on the goto issue, Knuth (1974) suggests a loop control statement that allows multiple exits. Read the paper and write an operational semantics description of the statement.

*Operational semantics are a category of formal programming language semantics in which certain desired properties of a program, such as correctness, safety or security, are verified by constructing proofs from logical statements about its execution and procedures, rather than by attaching mathematical meanings to its terms (denotational semantics).

9. What are the arguments both for and against the exclusive use of Boolean expressions in the control statements in Java (as opposed to also allowing arithmetic expressions, as in C++)?

*The primary argument for using Boolean expressions exclusively as control expressions is the reliability that results from disallowing a wide range of types for this use. In C, for example, an expression of any type can appear as a control expression, so typing errors that result in references to variables of incorrect types are not detected by the compiler as errors. No , it would not be a good idea. Although this custom precedence sounds like increasing flexibility, requiring parentheses to show a custom precedence would impact in readability and writability of a program.

10. In Ada, the choice lists of the case statement must be exhaustive, so that there can be no unrepresented values in the control expression. In C++, unrepresented values can be caught at run time with the default selector. If there is no default, an unrepresented value causes the whole statement to be skipped. What are the pros and cons of these two designs (Ada and C++)?

*Ada was designed for military grade software development. The idea is that whenever you modify code in such a way that a new case emerges (for example adding a new value for an enumeration type), you are forced to manually revisit (and therefore re-validate) all the case statements that analyze it. Having a "default" is risky: you may forget that there is a case somewhere where the new case should not have been handled by the default.

Chapter 7 Programming Language Concepts R Sebesta

Nama: Stefanus Eduard Adrian
NIM: 1801382963

Kali ini saya akan menjawab Assignment #7 dari Chapter 7 Programming Language Concepts R Sebesta

Review Questions

6. What associativity rules are used by APL?

*In APL, all operators have the same level of precedence. Thus, the order of evaluation of operators in APL expressions is determined entirely by the associativity rule, which is right to left for all operators.

7. What is the difference between the way operators are implemented in C++ and Ruby?

*The difference is in Ruby, all the arithmetic, relational, and assignment operator, as well as array indexing, shifts, and bitwise logic operators, are implemented as methods. While in C, they aren't implemented as methods.

8. Define functional side effect.

*A functional side effect is a side effect of a function which occurs when the function changes either one of its parameters or a global variable.

9. What is a coercion?

*A coercion is a process by which a compiler automatically converts a value of one type into a value of another type when that second type is required by the surrounding context.

10. What is a conditional expression?

*A conditional expression is an expression that returns value A or value B depending on whether a Boolean value is true or false. A conditional expression lets you write a single assignment statement that has the same effect as the following:

if condition:

    x = true_value

else:

    x = false_value

Problem Set

6. Should C’s single-operand assignment forms (for example, ++count) be included in other languages (that do not already have them)? Why or why not?

*Yes C should, because those assigning operations make operation simpler and easy to know if that operation is assigning operation. And it will ease the increment or even decrement while we use in looping.

7. Describe a situation in which the add operator in a programming language would not be commutative.

*If the add operator for a language is also used to concatenate strings, it’s quite apparent that it would not be commutative.

For example:

“abc” + “def” = “abcdef”

“def” + “abc” = “defabc”

These two strings are obviously not equal, so the addition operator is not commutative.

8. Describe a situation in which the add operator in a programming language would not be associative.

*It is not associative when it includes the other operator with higher precedence like the multiplication and division.

9. Assume the following rules of associativity and precedence for expressions:

Precedence

Highest           *, /, not

+, –, &, mod

                        – (unary)

=, /=, <, <=, >=, >

And

Lowest             or, xor

Associativity      Left to right

Show the order of evaluation of the following expressions by parenthesizing all subexpressions and placing a superscript on the right parenthesis to indicate order. For example, for the expression

a + b * c + d

the order of evaluation would be represented as

((a + (b * c)¹)² + d)³

a.  a * b - 1 + c                                ((( a * b )¹ - 1)² + c )³

b.  a * (b - 1) / c mod d                   ((( a * ( b - 1 )¹ )² / c )³ mod d )⁴

c.  (a - b) / c & (d * e / a - 3)          (((a - b)¹ / c)² & ((d * e)³ / a)⁴ - 3)⁵)⁶

d.  -a or c = d and e                        (( -a )¹ or ( ( c = d )² and e )³ )⁴

e.  a > b xor c or d <= 17               (((a > b)¹ xor c)³ or (d <= 17)² )⁴

f.   -a + b                                        (–( a + b )¹ )²

10. Show the order of evaluation of the expressions of Problem 9, assuming that there are no precedence rules and all operators associate right to left.

*

a. ( a * ( b – ( 1 + c )¹ )² )³

b. ( a * ( ( b – 1 )² / ( c mod d )¹ )³ )⁴

c. ( ( a – b )⁵ / ( c & ( d * ( e / ( a – 3 )¹ )² )³ )⁴ )⁶

d. ( – ( a or ( c = ( d and e )¹ )² )³ )⁴

e. ( a > ( xor ( c or ( d <= 17 )¹ )² )³ )⁴

f. ( – ( a + b )¹ )²

Chapter 6 Programming Language Concepts R Sebesta

Nama: Stefanus Eduard Adrian
NIM: 1801382963

Kali ini saya akan menjawab Assignment #6 dari Chapter 6 Programming Language Concepts R Sebesta

Review Questions

6. What are the advantages of user-defined enumeration types?

*User-defined enumeration types are most useful when a data type can take one of a small, discrete set of values, each of which have some meaning that is not a number. A favorite example in textbooks is a type for the suit of a playing card. There are four options: SPADE, CLUB, HEART, DIAMOND, and so we would make an enumeration type with these four entries. The main advantages are efficiency in storage (compared to e.g. storing these values as strings) and more readable code.

7. In what ways are the user-defined enumeration types of C# more reliable than those of C++?

*Since C# enumeration types are not coerced into integer types, as the C++ does so, it's more reliable.

8. What are the design issues for arrays?

*-What types are legal for subscripts?

-Are subscripting expressions in elemnet refrence range checked?

-When are subscript ranges bound?

-When does allocation take place?

-What is the maximum number of subscripts?

-Can array objects be initialized?

-Are any kind of slices supported?

9. Define static, fixed stack-dynamic, stack-dynamic, fixed heap-dynamic, and heap-dynamic arrays. What are the advantages of each?

*Static array is an array which the subscript ranges are statically bound and storage allocation is static (before run-time). The advantage is efficiency (no dynamic allocation).

Fixed stack-dynamic array is an array which the subscript ranges are statically bound, but the allocation is done at declaration time. The advantage is space efficiency

Stack-dynamic array is an array which the subscript ranges are dynamically bound and the storage allocation is dynamic (done at run-time). The advantage is flexibility (the size of an array need not be known until the array is to be used).

Fixed heap-dynamic array is similar to fixed stack-dynamic, storage binding is dynamic but fixed after allocation (i.e., binding is done when requested and storage is allocated from heap, not stack). The advantage of fixed heap-dynamic array is flexibility (the array’s size always fits the problem).

Heap-dynamic array is an array which the binding of subscript ranges and storage allocation is dynamic and can change any number of times. The advantage is flexibility (arrays can grow or shrink during program execution).

10. What happens when a nonexistent element of an array is referenced in Perl?

*If an r-value is required, undef is returned. If an l-value is required, the array is extended, then the newly created but undefined element is returned. No error is reported.

Problem Set

6. Explain all of the differences between Ada’s subtypes and derived types.

*Ada’s subtype is compatible with its base type, so you can mix operands of the base type with operands of the base type. While Ada’s derived type is a completely separate type that has the same characteristics as its base type. We can’t mix operands of a derived type with operands of the base type.

7. What significant justification is there for the -> operator in C and C++?

*The only justification for -> operator in C and C++ is writability. It is slightly easier to write p->q than (*p).q.

8. What are all of the differences between the enumeration types of C++ and those of Java?

*In C++, an enumeration is just a set of named, integral constants. Also, C++ will implicitly convert enum values to their integral equivalent. In Java, an enumeration is more like a named instance of a class. You have the ability to customize the members available on the enumeration. Java will explicitly convert enum values to their integral equivalent.

9. The unions in C and C++ are separate from the records of those languages, rather than combined as they are in Ada. What are the advantages and disadvantages to these two choices?

*

	Union separated from records	Union combined with records
Advantages	-Reduce developer overhead (less checking) -Goes with the C++ design (C++ is not a weak strong typing language)	-Support type checking -Goes with the Ada design (Ada is strong typing language)
Disadvantages	-No type checking of references -May end with wrong or unexpected results	-Increase developer overhead -Using more functions to resolve type compatibility

10. Multidimensional arrays can be stored in row major order, as in C++, or in column major order, as in Fortran. Develop the access functions for both of these arrangements for three-dimensional arrays.

*Let the subscript ranges of the three dimensions be named min(1), min(2), min(3), max(1), max(2), and max(3). Let the sizes of the subscript ranges be size(1), size(2), and size(3). Assume the element size is 1.

Row Major Order:

 location(a[i,j,k]) = (address of a[min(1),min(2),min(3)]) + ((i-min(1))*size(3) + (j-min(2)))*size(2) + (k-min(3))

Column Major Order:

 location(a[i,j,k]) = (address of a[min(1),min(2),min(3)]) + ((k-min(3))*size(1) + (j-min(2)))*size(2) + (i-min(1))

Chapter 5 Programming Language Concepts R Sebesta

Nama: Stefanus Eduard Adrian
NIM: 1801382963

Kali ini saya akan menjawab Assignment #5 dari Chapter 5 Programming Language Concepts R Sebesta

Review Questions

6. What is the l-value of a variable? What is the r-value?

*The l-value of a variable is the address of that variable. An l-value represents a storage region's "locator" value.

The r-value of a variable is the data (value) of that variable. All l-values are r-values but not all r-values are l-values.

7. Define binding and binding time.

* A binding is an association between an attribute and an entity, such as between a variable and its type or value, or between an operation and a symbol.

Binding time is the time at which a binding takes place.

8. After language design and implementation [what are the four times bindings can take place in a program?]

*-compile time (bind a variable to a type in C or Java)

-link time

-load time (bind a C or C++ static variable to a memory cell)

-run time (bind a nonstatic local variable to a memory cell)

9. Define static binding and dynamic binding.

*Static binding is a binding which occurs before run time and remains unchanged throughout program execution.

Dynamic binding is a binding which occurs during execution or can change during execution of the program.

10. What are the advantages and disadvantages of implicit declarations?

*Advantages:

-Can make it easier for the programmer to write code, since he/she doesn’t have to also write the declarations

-Maintainability can be easier too, since the information about a variable’s type is not written down in a part of the program distant from where the variable is used

-Readability can be better since a reader can probably infer the variable’s name or its context

Disadvantage:

-Reliability will probably suffer since the programmer may not always realize the type that the compiler assigned a variable

Problem Set

6. Consider the following JavaScript skeletal program:

// The main program var x;

function sub1() {

  var x;

  function sub2() {

    . . .

  }

}

function sub3() {

  . . . 

}    Assume that the execution of this program is in the following unit order:

main calls sub1

sub1 calls sub2

sub2 calls sub3

a. Assuming static scoping, in the following, which dec- laration of x is the correct one for a reference to x?

 i. sub1: sub1

ii. sub2: sub1

iii. sub3: main

b. Repeat part a, but assume dynamic scoping.

i. sub1: sub1

ii. sub2: sub1

iii. sub3: sub1

7. Assume the following JavaScript program was interpreted using static-scoping rules. What value of x is displayed in function sub1? Under dynamic-scoping rules, what value of x is displayed in function sub1?

var x; function sub1() {

  document.write("x = " + x + "<br />");

}

function sub2() {

  var x;

  x = 10;

  sub1();

}

x = 5;

sub2();

*Static scope: x=5

Dynamic scope: x=10

8. Consider the following JavaScript program:

var x, y, z; function sub1() {

  var a, y, z;

  function sub2() {

    var a, b, z;

    . . .

  }

  . . .

}

function sub3() {

  var a, x, w;

  . . .

}

List all the variables, along with the program units where they are declared, that are visible in the bodies of sub1, sub2, and sub3, assum- ing static scoping is used.

*sub1: a(sub1) y(sub1) z(sub1) x(main) 
sub2: a(sub2) b(sub2) z(sub2) y(sub1) x(main) 
sub3: a(sub3) x(sub3) w(sub3) y(main) z(main)

9. Consider the following Python program:

x = 1; y = 3;

z = 5;

def sub1():

  a = 7;

  y = 9;

  z = 11;

  . . .

def sub2():

  global x;

  a = 13;

  x = 15;

  w = 17;

  . . .

  def sub3():

    nonlocal a;

    a = 19;

    b = 21;

    z = 23;

    . . .

. . .

List all the variables, along with the program units where they are declared, that are visible in the bodies of sub1, sub2, and sub3, assum- ing static scoping is used.

* Variable           Where Declared

In sub1:

a                     sub1

y                     sub1

z                     sub1

x                     main

In sub2:

a                     sub2

x                     sub2

w                    sub2

y                     main

z                     main

In sub3:

a                     sub3

b                     sub3

z                     sub3

w                    sub2

x                     sub2

y                     main

10. Consider the following C program:

void fun(void) {  int a, b, c; /* definition 1 */

  . . .

  while (. . .) {

    int b, c, d; /*definition 2 */   

. . .  à1

    while (. . .) {

int c, d, e; /* definition 3 */   

 . . . à 2

     }  

 . . .  -à3

    } 

. . .  à4

}

For each of the four marked points in this function, list each visible vari- able, along with the number of the definition statement that defines it.

* Point 1: a:1 b:2 c:2 d:2

Point 2: a:1 b:2 c:3 d:3 e:3

Point 3: a:1 b:2 c:2 d:2

Point 4: a:1 b:1 c:1

Chapter 4 Programming Language Concepts R Sebesta

Nama: Stefanus Eduard Adrian
NIM: 1801382963

Kali ini saya akan menjawab Assignment #4 dari Chapter 4 Programming Language Concepts R Sebesta

Review Questions

6. What is a state transition diagram?

*A state transition diagram is a type of diagram used in computer science and related fields to describe the behavior of systems. State diagrams require that the system described is composed of a finite number of states.

7. Why are character classes used, rather than individual characters, for the letter and digit transitions of a state diagram for a lexical analyzer?

* The first thing to observe is that there are 52 different characters (any uppercase or lowercase letter) that can begin a name, which would require 52 transitions from the transition diagram’s initial state. However, a lexical analyzer is interested only in determining that it is a name and is not concerned with which specific name it happens to be. Therefore, we define a character class named LETTER for all 52 letters and use a single transition on the first letter of any name.

8. What are the two distinct goals of syntax analysis?

*There are two distinct goals of syntax analysis. First, the syntax analyzer must check the input program to determine whether it is syntactically correct. When an error is found, the analyzer must produce a diagnostic message and recover. In this case, recovery means it must get back to a normal state and continue its analysis of the input program. This step is required so that the
compiler finds as many errors as possible during a single analysis of the input program. If it is not done well, error recovery may create more errors, or St least more error messages. The second goal of syntax analysis is to produce a complete parse tree, or at least trace the structure of the complete parse tree, for syntactically correct input. The parse tree (or its trace) is used as the basis for translation.

9. Describe the differences between top-down and bottom-up parsers.

*Bottom-up parsing is a strategy for analyzing unknown data relationships that attempts to identify the most fundamental units first, and then to infer higher-order structures from them. It attempts to build trees upward toward the start symbol.

Top-down parsing is a strategy of analyzing unknown data relationships by hypothesizing general parse tree structures and then considering whether the known fundamental structures are compatible with the hypothesis.

10. Describe the parsing problem for a top-down parser.

*The parsing problems for a top-down parser:

-Only judges grammaticality.

-Stops when it finds a single derivation.

-No semantic knowledge employed.

-No way to rank the derivations.

-Problems with left-recursive rules.

-Problems with ungrammatical sentences.

Problem Set

6. Given the following grammar and the right sentential form, draw a parse tree and show the phrases and simple phrases, as well as the handle.

S → AbB | bAc    A → Ab | aBB    B → Ac | cBb | c

 a. Acccbbc

Phrases: aAcccbbc, aAcccb, Ac, ccb, c_1, c_2

Simple phrases: Ac, c_1, c_2

Handle: Ac

b. AbcaBccb

Phrases: AbcaBccb, caBccb, aBcc, aBc, c_1

Simple Phrases: c_1

Handle: c_1

c. baBcBbbc

Phrases: baBcBbbc, aBcBbb, aBcBb, cBb

Simple Phrases:cBb

Handle: cBb

7. Show a complete parse, including the parse stack contents, input string, and action for the string id * (id + id), using the grammar and parse table in Section 4.5.3.

*

Stack	Input	Action
0	id * (id + id) $	Shift 5
0id5	* (id + id) $	Reduce 6 (Use GOTO[0, F])
0F3	* (id + id) $	Reduce 4 (Use GOTO[0, T])
0T2	* (id + id) $	Reduce 2 (Use GOTO[0, E])
0T2*7	(id + id) $	Shift 7
0T2*7(4	id + id ) $	Shift 4
0T2*7(4id5	+ id ) $	Shift 5
0T2*7(4F3	+ id ) $	Reduce 6 (Use GOTO[4, F])
0T2*7(4T2	+ id ) $	Reduce 4 (Use GOTO[4, T])
0T2*7(4E8	+ id ) $	Reduce 2 (Use GOTO[4, E])
0T2*7(4E8+6	id ) $	Shift 6
0T2*7(4E8+6id5	) $	Shift 5
0T2*7(4E8+6F3	) $	Reduce 6 (Use GOTO[6, F])
0T2*7(4E8+6T9	) $	Reduce 4 (Use GOTO[6, T])
0T2*7(4E8	) $	Reduce 1 (Use GOTO[4, E])
0T2*7(4E8)11	$	Shift 11
0T2*7F10	$	Reduce 5 (Use GOTO[7, F])
0T2	$	Reduce 5 (Use GOTO[0, T])
0E1	$	Reduce 2 (Use GOTO[0, E])

8. Show a complete parse, including the parse stack contents, input string, and action for the string (id + id) * id, using the grammar and parse table in Section 4.5.3.

*

Stack	Input	Action
0	id * (id + id) $	Shift 5
0id5	* (id + id) $	Reduce 6 (Use GOTO[0, F])
0F3	* (id + id) $	Reduce 4 (Use GOTO[0, T])
0T2	* (id + id) $	Reduce 2 (Use GOTO[0, E])
0T2*7	(id + id) $	Shift 7
0T2*7(4	id + id ) $	Shift 4
0T2*7(4id5	+ id ) $	Shift 5
0T2*7(4F3	+ id ) $	Reduce 6 (Use GOTO[4, F])
0T2*7(4T2	+ id ) $	Reduce 4 (Use GOTO[4, T])
0T2*7(4E8	+ id ) $	Reduce 2 (Use GOTO[4, E])
0T2*7(4E8+6	id ) $	Shift 6
0T2*7(4E8+6id5	) $	Shift 5
0T2*7(4E8+6F3	) $	Reduce 6 (Use GOTO[6, F])
0T2*7(4E8+6T9	) $	Reduce 4 (Use GOTO[6, T])
0T2*7(4E8	) $	Reduce 1 (Use GOTO[4, E])
0T2*7(4E8)11	$	Shift 11
0T2*7F10	$	Reduce 5 (Use GOTO[7, F])
0T2	$	Reduce 5 (Use GOTO[0, T])
0E1	$	Reduce 2 (Use GOTO[0, E])

9. Write an EBNF rule that describes the while statement of Java or C++. Write the recursive-descent subprogram in Java or C++ for this rule.

*<while_stmt> -> WHILE '(' (<arith_expr> | <logic_expr>) ')'  <block>

  <block> -> <stmt> | '{' <stmt> {<stmt>} '}'

10. Write an EBNF rule that describes the for statement of Java or C++. Write the recursive-descent subprogram in Java or C++ for this rule.

*<while_stmt> -> WHILE '(' (<arith_expr> | <logic_expr>) ')'  <block>

  <block> -> <stmt> | '{' <stmt> {<stmt>} '}'