Pascal Compiler Research Articles

Performance Analysis of Fifth-Semester Physics Education: Assessing an Online Pascal Compiler in the Department of Mathematics and Natural Sciences Education at University of Mataram

This study evaluates the integration of online Pascal compilers in undergraduate physics education at the University of Mataram, focusing on its impact on students' programming skills. Over one semester, three classes (A, B, and C) of physics education students from the Department of Mathematics and Natural Sciences Education (PMIPA), Faculty of Teacher Training and Education (FKIP), University of Mataram, participated in lectures, discussions, and practical exercises using the GDB Online Pascal Compiler. Course content included Pascal fundamentals, arrays, matrices, and applications in physics, evaluated through assignments, mid-semester, and final exams. Quantitative analysis of student performance data revealed significant differences in mean scores and variability among the classes, with Class A achieving the highest average score and Class C exhibiting the greatest variability. Statistical tests confirmed that performance data for all classes deviated significantly from normal distribution, necessitating non-parametric tests. The Mann-Whitney U test indicated no statistically significant differences in median scores between class A vs. class B, class A vs. class C, and class B vs. class C, suggesting consistent performance outcomes across classes post-course. These findings underscore the potential of the online Pascal compiler in enhancing students' programming skills within the context of physics education.

CT-Based Evaluation of the Shape of the Diaphragm Using 3D Slicer.

The diaphragm is the main inspiratory muscle and separates the thorax and the abdomen. In COPD, the evaluation of the diaphragm shape is clinically important, especially in the case of hyperinflation. However, delineating the diaphragm remains a challenge as it cannot be seen entirely on CT scans. Therefore, the lungs, ribs, sternum, and lumbar vertebrae are used as surrogate landmarks to delineate the diaphragm. We herein describe a CT-based method for evaluating the shape of the diaphragm using 3D Slicer-a free software that allows delineation of the diaphragm landmarks-in ten COPD patients. Using the segmentation performed with 3D Slicer, the diaphragm shape was reconstructed with open-source Free Pascal Compiler. From this graduated model, the length of the muscle fibers, the radius of curvature, and the area of the diaphragm-the main determinants of its function-can be measured. Inter- and intra-user variabilities were evaluated with Bland and Altman plots and linear mixed models. Except for the coronal length (p = 0.049), there were not statistically significant inter- or intra-user differences (p values ranging from 0.326 to 0.910) suggesting that this method is reproducible and repeatable. In conclusion, 3D Slicer can be applied to CT scans for determining the shape of the diaphragm in COPD patients.

Perancangan Aplikasi Peramalan untuk Metode Exponential Smoothing Menggunakan Aplikasi Lazarus (Studi Kasus: Data Konsumsi Listrik Kota Samarinda)

Exponential smoothing is forecasting method used to predict the future. Lazarus is an open source software based on free pascal compiler. at this research, program Lazarus be design used exponential smoothing method to predict electricity consumption data in Samarinda City from September to November 2018. Purposed of this researched is to determine the procedure of building an exponential smoothing forecasting application and obtained forecasting result using the built application. Procedure of built the application are designed interface, designed properties and filled coding. The optimum smoothing parameters were obtained used the golden section method. Based on the analysis, electricity consumption data in Samarinda City shows a trend pattern, then the forecasting was used double exponential smoohting (DES) method are DES Brown and DES Holt. The best forecasting method for at this researched is DES Holt, because DES Holt method produced MAPE 0,0659% less than DES Brown method produced MAPE 0,0843%.

A window of multistability in Genesio-Tesi chaotic system, synchronization and application for securing information

In this work, we further investigate the dynamics of the Genesio-Tesi chaotic system which consists of a relatively simple jerk circuit with a quadratic nonlinearity. We complete and enrich the results obtained by Aceng et al. (2016). For this reason, we focus our interest in multistability generation and chaos synchronization as well. By using simulation software tools like PASCAL compiler, Orcad PSPICE and MATLAB, these properties have been characterized via common nonlinear tools including phase portraits, temporal responses, frequency responses, bifurcation diagrams and maximum lyapunov exponent plots. The analysis shows that the Genesio-Tesi system under consideration is able to exhibit complex and interesting behaviors including period doubling bifurcation, chaos, periodic windows and coexistence of multiple attractors. This latter phenomenon has not been found in previous studies of the Genesio-Tesi oscillator thus merits to be shared. We have also shown that Genesio-Tesi systems in their chaotic states can be synchronized and used for a possible masking of information, thus illustrating its importance in engineering. Numerical findings have been validated through experimental studies.

Compiling Vector Pascal to the XeonPhi

SummaryIntel's XeonPhi is a highly parallel x86 architecture chip made by Intel. It has a number of novel features which make it a particularly challenging target for the compiler writer. This paper describes the techniques used to port the Glasgow Vector Pascal Compiler to this architecture and assess its performance by comparisons of the XeonPhi with 3 other machines running the same algorithms. Copyright © 2015 John Wiley & Sons, Ltd.

Experimenting an implementation-focused approach to undergraduate compiler course

Compiler construction is one of the most challenging courses to teach in undergraduate computer science curriculum. In a traditional compiler course, many theoretical topics are covered and a compiler project is assigned. Our previous experience shows that this approach not only is challenging but also can be ineffective sometimes. To cover the extensive amount of material within a semester is a struggle. To expect students to produce a working compiler is also impractical since most undergraduates have little experience in developing large software. Our preliminary experiment using an implementation-focused approach produces many positive outcomes. In this approach, the lectures focused on the case study of the design and implementation of a Pascal compiler using a language independent framework. For the project, students successfully used the given language independent framework to design and develop a working compiler for a modified subset C language.

The distribution of a linear combination of R independent discrete random variables

In this paper we consider a formula to get the exact number of nonnegative integer solution of the equality a1x1 + a2x2 + … + arxr = n where a1, a2, … , ar and n are fixed integers. Using the obtained formula, we provide a program to list the solutions for every n and a1, … , ar by Pascal compiler. We then obtain the distribution of an arbitrary linear combination of discrete random variables based on the proposed algorithm. We also apply the algorithm to obtain the Maximum Likelihood estimation of the parameters of the distribution. The accuracy of the algorithm was illustrated using various examples.

SU‐FF‐T‐295: Using a 3‐Dimensional Kernel Density Estimator For The Scoring Of Radiotherapy Treatment Volumes Against Multiple Expert Observers

Purpose: Several techniques exist for the numerical assessment of radiotherapy treatment volumes against a ‘gold standard’ volume, such as the conformity index. Such techniques are unable to encompass variations in clinical practice between individuals and institutions, and are ineffective in the assessment of acceptable levels of intra‐observer variation in contouring. We present a novel algorithm based on a three‐dimensional kernel density estimator (3DKDE) to produce a statistic capable of scoring a single target volume against a solution set containing multiple expert volumes. Methods & Materials: The algorithm was coded using a multi‐threaded Pascal compiler. A graphical user interface allows the operator to load multiple expert outlines into the system, calculate the solution space and visualise it in 3D. Individual volumes can then be scored rapidly against all the volumes in the solution space. As a planning exercise, 3 expert observers were asked to contour the GTV for a patient with a resected glioblastoma. Each observer contoured the case on three separate occasions. A solution space with all 9 outlines was constructed to make assessments of inter‐observer and intra‐observer variation. Results: The system provides both a mean kernel density score (k‐score), and voxel‐by‐voxel scores in the form of a k‐score histogram. Similar outlines tend to have similar mean k‐scores and k‐score histogram profiles. Outlying volumes are readily identified by the system. Direct visualisation of the solution space provides information on the conformity between different expert observers, and intra‐observer variation in contouring. Conclusion: The 3DKDE scoring tool is a valuable technique for the quantitative assessment of volume contouring whilst taking into account variation in clinical practice. Further studies are planned to assess the utility of this technique in different disease sites.

Kinematical calculations of RHEED intensity oscillations during the growth of thin epitaxial films

A practical computing algorithm working in real time has been developed for calculating the reflection high-energy electron diffraction (RHEED) from the molecular beam epitaxy (MBE) growing surface. The calculations are based on the use of kinematical diffraction theory. Simple mathematical models are used for the growth simulation in order to investigate the fundamental behaviors of reflectivity change during the growth of thin epitaxial films prepared using MBE. Program summary Title of program:GROWTH Catalogue identifier:ADVL Program summary URL: http://cpc.cs.qub.ac.uk/summaries/ADVL Program obtainable from: CPC Program Library, Queen's University of Belfast, N. Ireland Distribution format: tar.gz Computer for which the program is designed and others on which is has been tested:Pentium-based PC Operating systems or monitors under which the program has been tested:Windows 9x, XP, NT Programming language used:Object Pascal Memory required to execute with typical data:more than 1 MB Number of bits in a word: 64 bits Number of processors used: 1 Number of lines in distributed program, including test data, etc.: 10 989 Number of bytes in distributed program, including test data, etc.:103 048 Nature of the physical problem:Reflection high-energy electron diffraction (RHEED) is a very useful technique for studying growth and surface analysis of thin epitaxial structures prepared using the molecular beam epitaxy (MBE). The simplest approach to calculating the RHEED intensity during the growth of thin epitaxial films is the kinematical diffraction theory (often called kinematical approximation), in which only a single scattering event is taken into account. The biggest advantage of this approach is that we can calculate RHEED intensity in real time. Also, the approach facilitates intuitive understanding of the growth mechanism and surface morphology [P.I. Cohen, G.S. Petrich, P.R. Pukite, G.J. Whaley, A.S. Arrott, Surf. Sci. 216 (1989) 222]. Method of solution:Epitaxial growth of thin films is modeled by a set of non-linear differential equations [P.I. Cohen, G.S. Petrich, P.R. Pukite, G.J. Whaley, A.S. Arrott, Surf. Sci. 216 (1989) 222]. The Runge–Kutta method with adaptive stepsize control was used for solving initial value problem for non-linear differential equations [W.H. Press, B.P. Flannery, S.A. Teukolsky, W.T. Vetterling, Numerical Recipes in Pascal: The Art of Scientific Computing; first ed., Cambridge University Press, 1989; See also: Numerical Recipes in C++, second ed., Cambridge University Press, 1992]. Typical running time: The typical running time is machine and user-parameters dependent. Unusual features of the program: The program is distributed in the form of a main project Growth.dpr file and an independent Rhd.pas file and should be compiled using Object Pascal compilers, including Borland Delphi.

Recovery of jump table case statements from binary code

One of the fundamental problems with the static analysis of binary (executable) code is that of recognizing, in a machine-independent way, the target addresses of n-conditional branches implemented via a jump table. Without these addresses, the decoding of the machine instructions for a given procedure is incomplete, leading to imprecise analysis of the code. In this paper we present a technique for recovering jump tables and their target addresses in a machine and compiler independent way. The technique is based on slicing and copy propagation. The assembly code of a procedure that contains an indexed jump is transformed into a normal form which allows us to determine where the jump table is located and what information it contains (e.g. offsets from the table or absolute addresses). The presented technique has been implemented and tested on SPARC and Pentium code generated by C, C++ , Fortran and Pascal compilers. Our tests show that up to 89% more of the code in a text segment can be found by using this technique, when compared against the standard method of decoding. The technique was developed as part of our retargetable binary translation framework UQBT; however, it is also suitable for other binary-manipulation and analysis tools such as binary profilers, instrumentors and decompilers.

A low-cost, accurate method of producing large quantities of digitally filtered images.

We demonstrate how to produce complex image transformations of bitmap files for vision experiments using the Cogimatic Vision Starter Kit (VSK) library of mathematical routines along with Visual Basic, C++, or the Delphi Pascal compiler. Implementing this system on an IBM-compatible PC running Windows 95, 98, or NT4 enables researchers to quickly and economically manipulate images for vision research. The VSK includes a simple stand-alone image-processing application. In addition, VSK has the ability to automate image transformations and to fully integrate image processing into new experimental software on the PC platform.

Are random walks random?

Random walks have been created using the pseudo-random generators in different computer language compilers (BASIC, PASCAL, FORTRAN, C++) using a Pentium processor. All the obtained paths have apparently a random behavior for short walks (∼2 14 steps). From long random walks (2 33 steps) different periods have been found, the shortest being 2 18 for PASCAL and the longest 2 31 for FORTRAN and C++, while BASIC had a 2 24 steps period. The BASIC, PASCAL and FORTRAN long walks had even (2 or 4) symmetries. The C++ walk systematically roams away from the origin. Using deviations from the mean-distance rule for random walks, 〈 d 2〉∝ N, a more severe criterion is found, e.g. random walks generated by a PASCAL compiler fulfills this criterion to N< 10 000 .

Portable parallelizing Fortran compiler

The Portable Parallelizing Fortran Compiler (PPFC) is an additional component for the portable programming environment developed in Tel-Aviv University for scientific code. This environment supports portable and efficient programming of diverse MIMD multiprocessors, both distributed- and shared-memory. Till now this environment has consisted of two tools: the Virtual Machine for MultiProcessors (VMMP) and the Portable Parallelizing Pascal compiler (P3C). We have added the PPFC which is an automatic parallelizer compiler for the Fortran language. The compiler is fully automatic (does not require additional declarations to assist parallelization), which is characterized by loops operating on regular data structures, and produces efficient and portable code for a variety of multiprocessors from the same serial code. The parallel implementation uses the VMMP, which is a software package that provides a coherent set of services for explicitly parallel application programs running on diverse MIMD multiprocessors. VMMP is intended to simplify parallel program writing and to promote portable and efficient programming. The PPFC parallelized 12 out of the 24 Livermore Loops. It was also applied to parallelize all the 14 Fortran application programs that where parallelized by the P3C and achieved the same speed-ups and efficiencies. In most examples the PPFC achieved high speed-ups and efficiencies on all target multiprocessors. The PPFC emphasizes efficiency and code portability. Although PPFC employs a relatively simple data flow analysis, it produces efficient code for various widely used application programs.

Alias analysis of pointers in Pascal and Fortran 90: dependence analysis between pointer references

Vectorization and parallelization of programs written in languages where pointers are used is now a subject of increasing interest. The presence of pointers in programs, however, poses new problems to dependence analysis in vectorizing and parallelizing compilers which had been designed to target only at FORTRAN77 programs. In this paper, a new method to analyze dependencies between pointer references in Pascal is proposed, which can also be applied to Fortran 90. It is designed to handle programs with dynamic data structures, such as linear linked lists or trees, which are the most common use of pointers. The method divides into two stages. The first stage is a safe alias analysis which handles any kind of dynamic data structures. The second stage focuses on the specific data structures. It first detects linear linked lists, and then performs dependence analysis between pointer references to the same list. The paper also proposes ways to enhance the second stage. Tree structures are handled here. Loops which manipulate linked lists can now be considered for vectorization by the proposed analysis. Techniques to vectorize such loops are presented in this paper. Some of the proposed algorithms are implemented in V-Pascal, the automatic vectorizing Pascal compiler of our laboratory. The effectiveness of the vectorization of list operations is proved by an experiment on HITAC S-820/80.

Portable parallelizing Fortran compiler

The Portable Parallelizing Fortran Compiler (PPFC) is an additional component for the portable programming environment developed in Tel-Aviv University for scientific code. This environment supports portable and efficient programming of diverse MIMD multiprocessors, both distributed- and shared-memory. Till now this environment has consisted of two tools: the Virtual Machine for MultiProcessors (VMMP) and the Portable Parallelizing Pascal compiler (P3C). We have added the PPFC which is an automatic parallelizer compiler for the Fortran language. The compiler is fully automatic (does not require additional declarations to assist parallelization), which is characterized by loops operating on regular data structures, and produces efficient and portable code for a variety of multiprocessors from the same serial code. The parallel implementation uses the VMMP, which is a software package that provides a coherent set of services for explicitly parallel application programs running on diverse MIMD multiprocessors. VMMP is intended to simplify parallel program writing and to promote portable and efficient programming. The PPFC parallelized 12 out of the 24 Livermore Loops. It was also applied to parallelize all the 14 Fortran application programs that where parallelized by the P3C and achieved the same speed-ups and efficiencies. In most examples the PPFC achieved high speed-ups and efficiencies on all target multiprocessors. The PPFC emphasizes efficiency and code portability. Although PPFC employs a relatively simple data flow analysis, it produces efficient code for various widely used application programs.

Type Inference of Turbo Pascal

&lt;p&gt;Type inference is generally thought of as being an exclusive property of&lt;br /&gt;the functional programming paradigm. We argue that such a feature may be&lt;br /&gt;of significant benefit for also standard imperative languages. We present a&lt;br /&gt;working tool (available by WWW) providing these benefits for a full version&lt;br /&gt;of Turbo Pascal. It has the form of a preprocessor that analyzes programs&lt;br /&gt;in which the type annotations are only partial or even absent. The resulting&lt;br /&gt;program has full type annotations, will be accepted by the standard Turbo&lt;br /&gt;Pascal compiler, and has polymorphic use of procedures resolved by means&lt;br /&gt;of code expansion.&lt;/p&gt;&lt;p&gt;Keywords: imperative languages, type inference.&lt;/p&gt;

Decision support system for multicriteria machine selection for flexible manufacturing systems

This paper proposes an approach to the design and development of an intelligent Decision Support System (DSS) that is intended to help the selection process of alternative machines for Flexible Manufacturing Systems (FMS). The process consists of a series of steps starting with an analysis of the information and culminating in a conclusion —a selection from several available alternatives and verification of the selected alternative to solve the problem. In real decision situations, more than one criterion is present, and the problem becomes multicriteria decision making. The approach presented combines the Analytic Hierarchy Process (AHP) technique for multicriteria decision making with the rule-based technique for creating Expert Systems (ES). Such an approach allows the past experience, expressed as heuristics in ES, to be used. Moreover, this approach determines the architecture of the computer-based environment necessary for the decision support software system to be created. It includes the AHP software package (Expert Choice), Dbase III + DBMS, Expert System shell (EXSYS) and Turbo Pascal compiler (for the external procedural programs). As a result, a prototype decision support system for a fixed domain, namely a CNC turning center that is required to process a family of rotational parts, is developed. It helps the user to find the most “satisfactory” machine on the basis of several objective as well as subjective attributes.

Testing student-made compilers

This article presents a few guidelines and examples for testing Pascal compilers designed by students in introductory courses. A standard Pascal subset with little alteration is used, and the possible sources of errors are divided into eight categories. Examples and probable sources of error are exposed for each category.

Self-reference is an illustrative essential

This paper includes an abstract, a discussion of the usefulness of self-reference in early computer science courses, and some examples to illustrate this usefulness. Most readers will not be troubled by this example of self-referential writing. Why then is self-reference, usually in the form of recursive subprograms, thought to be so onerous as to be placed in its own left-until-the-end-and-often-uncovered chapter in most introductory texts? Self-reference is one of the cornerstones of computer science from the unsolvability of the halting problem, to writing a Pascal compiler in Pascal, to reveling in the beauty of Quicksort. We argue that the notion of self-reference should permeate first courses in computer science. If this is to be the case such courses should take a view far broader than “Wow, I can average 10 numbers with the skills I learned in my first programming course!”

Portable, parallelizing Pascal compiler

The structure and implementation of P/sup 3/C, a compiler that uses relatively simple parallelization techniques to produce highly efficient code for both shared-memory and distributed-memory MIMD multiprocessors, are discussed. P/sup 3/C is a fully automatic, portable parallelizing Pascal compiler for scientific code, which is characterized by loops operating on regular data structures. P/sup 3/C compiles the same source code to all target machines without modification. P/sup 3/C gives an accurate estimate about whether the parallel code will actually reduce execution time over serial code, taking into account the associated overhead. It derives the estimate by statically analyzing the program at compile time, referring to a table of the target machine's parameters. Speedups of up to 24 have been achieved on a Sequent Symmetry with 25 active processors. The estimated speedup was within 8% of the actual figure.< <ETX xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">&gt;</ETX>