Searching for "On Ordered Context-Free Grammars" – sorted by Relevance.
-
Utilization of a Novel Ordered Context Free Grammar for Object Based Parsing and Unification
- Utilization of a Novel Ordered Context Free Grammar for Object Based Parsing and Unification
- Add To MetaCart
-
Concise concrete syntax
- introduce a notion of ordered context-free grammars (OCFGs) with datatype tags to concisely specify grammars
- Cited by 3 (0 self) – Add To MetaCart
-
Regulated Finite Index Language Families Collapse
- ,holzerg@(email omitted); Abstract. We prove normal form theorems for programmed, ordered, and random context, context-free grammars
- Cited by 4 (4 self) – Add To MetaCart
-
Interpreter Prototypes From Formal Language Definitions
- semantics and of the use of higher order context free grammars for context sensitivity are presented in: G
- Cited by 5 (3 self) – Add To MetaCart
-
1 Well-Nested Drawings as Models of Syntactic Structure 1
- between derivation structure and word order. Context-free grammars do not allow any flexibility at all
- Add To MetaCart
-
Modular Syntax Demands Verification
- of the ordered context-free grammars used in first-match backtracking parsing methods. Indeed, the parsers
- Cited by 3 (1 self) – Add To MetaCart
-
Well-nested drawings as models of syntactic structure
- . Context-free grammars do not allow any flexibility at all; derivation structure determines word order
- Cited by 8 (6 self) – Add To MetaCart
-
A Highly Parallel Model for Object-Oriented Concurrent Constraint Programming
- (N,i) to refer to the ith argument of N using a left-to-right ordering. The context-free grammar for describing a
- Cited by 4 (4 self) – Add To MetaCart
-
Object-Oriented Term Graph Rewriting
- (N,i) to refer to the ith argument of N using a left-to-right ordering. The context-free grammar for describing a
- Cited by 3 (3 self) – Add To MetaCart
-
Concurrent Object-Oriented Programming Using Term Graph Rewriting Techniques
- . The context-free grammar for describing a graph could be something like graph ::= node | node+graph node ::= A
- Cited by 1 (1 self) – Add To MetaCart

