PHP 和 Oracle 技术在图书馆新闻管理系统中的应用

针对目前高校图书馆新闻管理系统开发成本高、集成化程度低、互动性不够等问题,采用 PHP 和 Oracle 数据库技术,设计并实现了一套图书馆新闻管理系统。该系统前台实现了新闻信息显示、搜索功能,系统后台实现了用户登录、添加新闻信息、修改新闻信息以及删除信息等功能。     

Combining preprocessor slicing with C/C++ language slicing

Of the very few practical implementations of program slicing algorithms, the majority deal with C/C++ programs. Yet, preprocessor-related issues have been marginally addressed by these slicers, despite the fact that ignoring (or only partially handling) these constructs may lead to serious inaccuracies in the slicing results and hence in the program analysis task being performed. Recently, an accurate slicing method for preprocessor-related constructs has been proposed, which-when combined with existing C/C++ language slicers-can provide more complete slices and hence a more successful analysis of programs written in one of these languages. In this paper, we present our approach which combines the two slicing methods and, via practical experiments, describe its benefits in terms of the completeness of the resulting slices.     

树型结构预处理算法及在游戏引擎中的实现

经过分析和验证，以八叉树碰撞节点生成为例，采用文件一次性记录划分结果，并在渲染时从文件读取，有效的缩短了生成八叉树的时间。此项设计也是游戏引擎中的一个功能模块。     

Conversion of simulation processes to pascal constructs

Although the expressive power of retentive control is widely accepted, languages possessing such control forms are not always available. In this paper, we present an implementation technique to extend a recursive language to one containing simulation processes. In particular, we report on the design of a preprocessor that translates SimCal, a language that combines Pascal and the process abstraction of Simula, into Pascal. The translation is done automatically by the preprocessor without additional information from the user. The preprocessor has been implemented for a microcomputer using Turbo Pascal, which is also used as the target language. SimCal has been found to be useful for teaching simulation and for programming simulation applications.     

An implementation of precompiled headers

Compilation time can be improved by precompiling interfaces so that the compiler can avoid processing unreferenced declarations. However, in C-based languages precompiling a header is difficult because a header can have several meanings depending on the context in which it is included. We present an ad hoc solution to this problem, and give the results of our precompilation strategy, which improved compile times by 25 to 65 per cent over compilation without precompiled headers.     

Overhead in FORTRAN preprocessors

The quality of code generated by two commercially available FORTRAN preprocessors is examined. These preprocessors augment FORTRAN with ‘structured’ control structures such as the IF-THEN-ELSE and WHILE statements. Two versions of benchmark programs were written and tested, one version produced by the preprocessor, the other, performing the same computation, produced by careful hand-coding directly in FORTRAN. The code generated by the preprocessor and the code written directly in FORTRAN were then compiled. The resulting object modules were then compared for relative execution time and size. This experiment was repeated on three computers, and five compilers with various optimization levels. The results indicate that a substantial overhead in storage space may be paid by using a preprocessor rather than direct coding in FORTRAN, and that in some cases execution time may be increased somewhat by using a FORTRAN preprocessor.     

A program structuring preprocessor for a macro assembly language

This paper deals with design considerations and implementation of a program structuring preprocessor for a macro assembly language. The macro assembly language is used for writing the code generation pass of a compiler. Macro instructions become lengthy, tedious and cumbersome when they incorporate some mild code improvement. This is chiefly because the macro assembly language lacks an adequate program structuring facility. Program structuring is a great help in improving ease of programming and the under-standability of the expansion control statements of a macro instruction in such a kind of programming. Considerations on the design of the source language and the outline of implementation are described. The design objective is ease of implementation and ease of use, and is fairly well satisfied by the language.     

Experiences with a schematic logic preprocessor

A COBOL preprocessor to implement Michael Jackson's program design language, Schematic Logic, has been written and used in the Computation Department at UMIST. This paper investigates the problems inherent in using preprocessors of this type and details the advantages which accrue from the preprocessor when teaching and using the Jackson Method.     

在线质谱仪一级预处理器在高炉监控中的成功改造

通过高炉工艺监控中测量水煤气组份气的质谱仪一级预处理器的成功改造应用,为煤化工设计院、气化运行、分析仪检修提供依据,保证气化装置安全、高效、经济运行,取得良好的节能效益。     

Structured FORTRAN preprocessors generating optimized output

Usually a structured FORTRAN program is transformed into a standard FORTRAN program by means of a one-pass preprocessor. In this case, several problems are caused by the many redundant continue and goto statements that a preprocessor generates. These problems include: (i) the generated FORTRAN program is not easy to read; (ii) the size of files to store the related programs becomes large; (iii) the total time increases for executing both the FORTRAN compiler and the output program itself. This paper presents a new scheme for constructing a one-pass preprocessor that generates the optimized FORTRAN code by suppressing the redundant statements. By employing this scheme we have constructed our own preprocessors for Westran (one of the Structured FORTRAN languages) and Ratfor and measured these against the traditional preprocessors for the Westran and Ratfor languages. One of the results is as follows. The total time for users, namely ‘preprocessing time + FORTRAN compiling time’ is rather less than the traditional ones. This is due to the fact that to suppress the input/output of the redundant statements from/to files contributes to the decreasing of both preprocessing and compiling times, and this compensates completely the time-overhead of the optimization process.