Accession Number : ADA305990
Title : An Efficient Method for Parsing Large Finite Element Data Files.
Descriptive Note : Final rept. Jun-Sep 95,
Corporate Author : ARMY RESEARCH LAB ABERDEEN PROVING GROUND MD
Personal Author(s) : Shires, Dale
PDF Url : ADA305990
Report Date : MAR 1996
Pagination or Media Count : 34
Abstract : The FORTRAN language has been and continues to be one of the most heavily used languages for implementing complex numerical algorithms. It is extremely efficient, and the straightforward constructs of the language allow today's FORTRAN compilers to take full advantage of the most novel parallel and vector computers. Many of these algorithms require large data sets to be read. This is the one task in which FORTRAN is somewhat lacking. While the main computation task should be left in FORTRAN, parsing tasks should be performed by applications with greater character stream access. Accessing and processing this character stream that is formed while the file is being read is known as parsing. This paper describes the tools available on most UNIX systems which can produce very fast parsers, the underlying methods employed by these tools, and ways these tools can be integrated with FORTRAN numerical solvers. (AN)
Descriptors : *DATA MANAGEMENT, *FINITE ELEMENT ANALYSIS, *INPUT OUTPUT PROCESSING, DATA BASES, ALGORITHMS, DISTRIBUTED DATA PROCESSING, EFFICIENCY, RULE BASED SYSTEMS, PARALLEL PROCESSING, FORTRAN, OPERATING SYSTEMS(COMPUTERS), ACCESS, PATTERN RECOGNITION, COMPUTER FILES, COMPUTER PROGRAM VERIFICATION, COMPILERS, SYNTAX, PARSERS, STRUCTURED PROGRAMMING, AUTOMATA, CONTEXT FREE GRAMMARS, C PROGRAMMING LANGUAGE.
Subject Categories : Computer Programming and Software
Distribution Statement : APPROVED FOR PUBLIC RELEASE