Gough, K. John. Syntax Analysis and Software Tools. Addison-Wesley Publishing Company, New York, New York, 1988. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Input Validation Testing: A System Level, Early Lifecycle Technique - Hayes (1998) (Correct)
....used extensively by older programs (FORTRAN, COBOL) and still used widely today is that of obtaining user input through text entries made via the keyboard. Programs that accept free form input, interactive input from the user, free form numbers, etc. are all examples of syntax driven applications [12]. In this dissertation, syntax driven application is defined as an application that accepts inputs from the user, constructed and arranged properly, that control the flow of the application. 1.1 Motivation Keyboard data entry is error prone, especially if the data must conform to specific format ....
....AmbiguousGrammar ambiguous grammar 32 3.3 How To Generate Valid Test Cases for a User Command Language Specification The user command language specification is used to generate a covering set of test cases. One can think of the syntax graph as being similar to a program control flowgraph [5,11,12,18]. The all edges testing criterion [11] is adapted to generate test cases that cover the syntax graph. The processing involves traversing the syntax graph and generating test cases to satisfy the all edges testing criterion. Each data element is considered a node in the syntax graph. Valid, ....
Gough, K. John. Syntax Analysis and Software Tools. Addison-Wesley Publishing Company, New York, New York, 1988.
Type Extension and Efficient AST Manipulation - John Gough (1993) Self-citation (Gough) (Correct)
....supports safe and efficient automaticgarbage collection. In this area it is in stark contrast to (say) C . 3 Abstract Syntax Trees and Oberon 2 A very flexible way of constructing software tools depends on the realisation of abstract syntax trees (AST s) by pointer linked data structures [9]. Various formalisations have been introduced to describe such structures [10] In conventional languages such heterogeneous structures are implemented using variant records union types. This is necessary, of course, because in strongly typed languages a pointer is only bound to a single type. In ....
Gough, K.J., Syntax Analysis and Software Tools, Addison-Wesley, 1988.
Efficient Recognition of Events in a Distributed System - John Gough (1995) (13 citations) Self-citation (Gough) (Correct)
....the following forms: Equality tests . Simple inequalities on totally ordered domains . Subranges on totally ordered domains . Set membership in finite domains 4. 1 Simplifications in Subset Construction Method In the classic subset construction procedure used to transform a NFSA to DFSA [1], it is assumed that one alphabet is used over all transitions. In the problem presented here, distinct alphabets are used at each level. It is obvious that a single alphabet could be produced by taking the union of all the individual alphabets, with appropriate renaming. Hence the classical ....
Gough, K. J. (1988). Syntax Analysis and Software Tools. International Computer Science Series, Addison-Wesley Publishing Company.
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