R. Sethi. Programming Languages, Concepts and Constructs, 2nd Edition. Addison Wesley, 1996.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....(fields of) actual arguments in a method call; this analysis is necessary to give access to objects such as file descriptors, which may result in excepting computations during the lifetime of this method call. Exception handler analysis uses a compile time representation of the program call tree [29] to guide the backwards search from an exception occurrence point to a handler. The call tree records the sequence of method calls that may occur during execution in a tree structure. Its nodes are methods and its edges connect the calling method with the called method (annotated by the call ....

R. Sethi. Programming Languages, Concepts and Constructs, 2nd Edition. Addison Wesley, 1996.

....transitions and guards, the concept of unification must be discussed. IDIOT uses unification to test guard expressions. An expression is unifiable if the value on the left hand side and that on the right of the = sign can be combined. The reader is refered to standard textbooks on this topic: [Set89] for example. Simply put, an expression of the form x = y is unifiable if x and y both have the same value. If one of x or y does not have a value bound to it, it assumes the value of the other variable. This allows assignment to occur, without requiring unique assignment and equality operators. ....

Ravi Sethi. Programming Languages, Concepts and Constructs. Addison-Wesley, 1989.

....the hardware requirements, careful consideration should also be taken in the choice of programming language that is used to actually implement the software on this architecture. Given the discussed requirements for this particular embedded system so far, the following issues have to be considered [11, 54]: 16 CHAPTER 3. CACE: DESIGN CONSIDERATIONS ffl Multitasking support and scalable multiprocessor support Modula II, the programming language used in the original cace system provides constructs for expressing concurrency, but not parallelism. As the new architecture will consist of multiple ....

....ARCHITECTURE A disadvantage of occam over most high level programming languages is that occam does not support structured data types. Structured types are composed of elements that are each of different type and help in the natural abstraction from the information that needs to be represented [54]. Although data structures can always be rewritten into occam s simple data types and arrays, this has a negative impact on the readability of a program. Maintainability The abstraction of a program into independent subprocesses in occam results in a reduction in complexity that makes it easier ....

[Article contains additional citation context not shown here]

Ravi Sethi. Programming Languages (concepts and constructs). Addison Wesley, 1990. ISBN 0-201-10365-6.

....of the program. In other cases, the nonground tuples are essential. An example is a program containing a fact p(X; X) that states that p is true if its two arguments are equal. 2. 3 Tail Recursion Consider the following C code fragment for a recursive binary search procedure, based on one from [22]. int search(int lo, int hi, int val) int k; if (lo hi) return 0; k = lo hi) 2; if (val = List[k] return 1; else if (val List[k] return search(lo,k 1,val) else if (val List[k] return search(k 1,hi,val) This procedure searches for the value val in the global array List, whose ....

Sethi, R. Programming Languages, Concepts and Constructs. Addison-Wesley, Reading, MA, 1989.

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC