[go: up one dir, main page]

Kaul, 1986 - Google Patents

Practical applications of precedence graph grammars

Kaul, 1986

View PDF
Document ID
12967054556486076006
Author
Kaul M
Publication year
Publication venue
International Workshop on Graph Grammars and Their Application to Computer Science

External Links

Snippet

Precedence graph grammars are of major interest in all those applications of graph grammars, where highly efficient parsers are needed. Up to now there are no other graph parsers with the same performance. Due to the fact, that even regular graph grammars with …
Continue reading at www.academia.edu (PDF) (other versions)

Classifications

    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F17/00—Digital computing or data processing equipment or methods, specially adapted for specific functions
    • G06F17/20—Handling natural language data
    • G06F17/27—Automatic analysis, e.g. parsing
    • G06F17/2705—Parsing
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F17/00—Digital computing or data processing equipment or methods, specially adapted for specific functions
    • G06F17/30—Information retrieval; Database structures therefor; File system structures therefor
    • G06F17/30943—Information retrieval; Database structures therefor; File system structures therefor details of database functions independent of the retrieved data type
    • G06F17/30946—Information retrieval; Database structures therefor; File system structures therefor details of database functions independent of the retrieved data type indexing structures
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F8/00—Arrangements for software engineering
    • G06F8/40—Transformations of program code
    • G06F8/41—Compilation
    • G06F8/42—Syntactic analysis
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F17/00—Digital computing or data processing equipment or methods, specially adapted for specific functions
    • G06F17/30—Information retrieval; Database structures therefor; File system structures therefor
    • G06F17/30286—Information retrieval; Database structures therefor; File system structures therefor in structured data stores
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F17/00—Digital computing or data processing equipment or methods, specially adapted for specific functions
    • G06F17/20—Handling natural language data
    • G06F17/21—Text processing
    • G06F17/22—Manipulating or registering by use of codes, e.g. in sequence of text characters
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F8/00—Arrangements for software engineering
    • G06F8/40—Transformations of program code
    • G06F8/41—Compilation
    • G06F8/43—Checking; Contextual analysis
    • G06F8/436—Semantic checking
    • G06F8/437—Type checking
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F17/00—Digital computing or data processing equipment or methods, specially adapted for specific functions
    • G06F17/30—Information retrieval; Database structures therefor; File system structures therefor
    • G06F17/30908—Information retrieval; Database structures therefor; File system structures therefor of semistructured data, the undelying structure being taken into account, e.g. mark-up language structure data
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F11/00—Error detection; Error correction; Monitoring
    • G06F11/36—Preventing errors by testing or debugging software
    • G06F11/3604—Software analysis for verifying properties of programs
    • G06F11/3608—Software analysis for verifying properties of programs using formal methods, e.g. model checking, abstract interpretation
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F17/00—Digital computing or data processing equipment or methods, specially adapted for specific functions
    • G06F17/50—Computer-aided design
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F8/00—Arrangements for software engineering
    • G06F8/70—Software maintenance or management

Similar Documents

Publication Publication Date Title
Heath et al. Stack and queue layouts of directed acyclic graphs: Part II
Barrett et al. Formal-language-constrained path problems
Muscholl et al. Deciding properties for message sequence charts
Costagliola et al. A parsing methodology for the implementation of visual systems
Kaul Practical applications of precedence graph grammars
JPH0713966A (en) Editing method of document
Różowski et al. Probabilistic guarded KAT modulo bisimilarity: Completeness and complexity
Richter Noncorrecting syntax error recovery
Chen et al. Formal Proofs of Tarjan's Strongly Connected Components Algorithm in Why3, Coq and Isabelle
Boiten Improving recursive functions by inverting the order of evaluation
US12292897B2 (en) Method, apparatus, and computer-readable medium for extracting a subset from a database
Stratulat Validating back-links of FOLID cyclic pre-proofs
Mattmüller et al. On the relationship between state-dependent action costs and conditional effects in planning
Okhotin LR parsing for conjunctive grammars
Henzinger Improved data structures for fully dynamic biconnectivity
Grammars Practical Applications
Pugh Extending Graham-Glanville techniques for optimal code generation
Flesca et al. Partially ordered regular languages for graph queries
Kaul Specification of error distances for graphs by precedence graph grammars and fast recognition of similarity
Kavvadias et al. Hammock-on-ears decomposition: A technique for the efficient parallel solution of shortest paths and other problems
Vizovitin et al. Verifying UCM specifications of distributed systems using colored Petri nets
Engelfriet et al. The equivalence of bottom-up and top-down tree-to-graph transducers
GRAMMARS OF GRAPHS IN 0 (3) TIME WITH
Boerman Formal verification of a sequential SCC algorithm
Benczúr On extended nested relational schemas generated by context-free grammars