Browsing by Author "YANG, W"

Now showing 1 - 4 of 4

A PRECISION EXPERIMENT ON ELECTRONS, PHOTONS AND MUONS AT LHC
(1993-02-01)
AZIZ, T
;
BOCK, R
;
BRAUNSCHWEIG, W
;
GEULIG, E
;
HILGERS, K
We describe the upgrade of the L3 detector for running at LHC. The principle goals are the precise measurement of electrons, photons and muons.
AN INCREMENTAL LL(1) PARSING ALGORITHM
(1993-11-08)
YANG, W
;
交大名義發表
;
資訊工程學系
;
National Chiao Tung University
;
Department of Computer Science
Given a parse tree for a sentence xzy and a string zBAR, an incremental parser builds the parse tree for the sentence xzyBAR by reusing as much of the parse tree for xzy as possible. The incremental LL(1) parsing algorithm in this paper makes use of a break-point table to identify reusable subtrees of the original parse tree in building the new parse tree. The break-point table may be computed from the grammar.
HOW TO MERGE PROGRAM TEXTS
(1994-11-01)
YANG, W
;
交大名義發表
;
資訊工程學系
;
National Chiao Tung University
;
Department of Computer Science
Software usually exists in multiple versions. All these versions must evolve in parallel. We propose a program-merging system that helps programmers to manage the evolution of all versions, which is much needed in software development and maintenance environments. The system can either combine two programs or it can combine changes to a base program. The system consists of three stages: a syntax-based comparator, a synchronous printer, and a merging editor. Based on the differences between the two programs identified by the syntax-based comparator, the synchronous printer combines the texts of two programs. Because there may be conflicts between the two programs, a merging editor provides the user with commands to resolve the conflicts. Another distinct feature of the merging system is the generator approach to producing syntactic program comparators for new programming languages.
ON THE LOOK-AHEAD PROBLEM IN LEXICAL ANALYSIS
(1995-08-01)
YANG, W
;
交大名義發表
;
資訊工程學系
;
National Chiao Tung University
;
Department of Computer Science
Modern programming languages use regular expressions to define valid tokens, Traditional lexical analyzers based on minimum deterministic finite automata for regular expressions cannot handle the look-ahead problem. The scanner writer needs to explicitly identify the look-ahead states and code the buffering and re-scanning operations by hand. We identify the class of finite look-ahead finite automata, which is general enough to include all finite automata of practical lexical analyzers, Finite look-ahead finite automata are then transformed into suffix finite automata. A new lexical analyzer makes use of the suffix finite automata to identify tokens. The new lexical analyzer solves the look-ahead problem in a table-driven approach and it can detect lexical errors at an earlier time than traditional lexical analyzers. The extra cost of the new lexical analyzers is the larger state transition table and three additional 1-dimensional tables. Incremental lexical analysis is also discussed.