Pages that link to "Item:Q5578055"
From MaRDI portal
The following pages link to An efficient context-free parsing algorithm (Q5578055):
Displaying 50 items.
- Approximate matching between a context-free grammar and a finite-state automaton (Q259082) (← links)
- A new one pass algorithm for estimating stochastic context-free grammars (Q294698) (← links)
- Conjunctive and Boolean grammars: the true general case of the context-free grammars (Q394967) (← links)
- An extended Earley's algorithm for Petri net controlled grammars without \(\lambda\) rules and cyclic rules (Q442111) (← links)
- On the incremental growth and shrinkage of LR goto-graphs (Q471185) (← links)
- The weighted grammar constraint (Q545550) (← links)
- Recognition mechanisms for schema-based knowledge representations (Q594605) (← links)
- A syntactic approach based on distortion-tolerant Adjacency Grammars and a spatial-directed parser to interpret sketched diagrams (Q609149) (← links)
- Approximately matching context-free languages (Q673469) (← links)
- Precedences in specifications and implementations of programming languages (Q673491) (← links)
- A sheaf-theoretic approach to pattern matching and related problems (Q685382) (← links)
- Systolic parsing of context-free languages (Q756431) (← links)
- An efficient all-parses systolic algorithm for general context-free parsing (Q757072) (← links)
- How to produce all sentences from a two-level grammar (Q800100) (← links)
- An efficient recognizer for the Boolean closure of context-free languages (Q802880) (← links)
- A general context-free parsing algorithm running in linear time on every LR(k) grammar without using lookahead (Q805244) (← links)
- On the complexity of the recognition of parallel 2D-image languages (Q808271) (← links)
- Technical analysis for portofolio trading by syntactic pattern recognition (Q810353) (← links)
- Lexical ambiguity in tree adjoining grammars (Q909476) (← links)
- Unambiguous Boolean grammars (Q948095) (← links)
- Toward discourse representation via pregroup grammars (Q1006460) (← links)
- Early action in an Earley parser (Q1038423) (← links)
- Applications of scheduling theory to formal language theory (Q1082085) (← links)
- A Yacc extension for LRR grammar parsing (Q1092677) (← links)
- Interleaving natural language parsing and generation through uniform processing (Q1128613) (← links)
- Parsing schemata and correctness of parsing algorithms (Q1129124) (← links)
- Computing abstract decorations of parse forests using dynamic programming and algebraic power series (Q1129128) (← links)
- Information flow in tabular interpretations for generalized push-down automata (Q1129130) (← links)
- PHRASE parsers from multi-axiom grammars (Q1129132) (← links)
- Parsing extended LR(k) grammars (Q1138389) (← links)
- Local constraints in programming languages. I: Syntax (Q1143180) (← links)
- Definite clause grammars for language analysis - A survey of the formalism and a comparison with augmented transition networks (Q1143818) (← links)
- SR(s,k) parsers: A class of shift-reduce bounded-context parsers (Q1157922) (← links)
- A recursive ascent Earley parser (Q1186582) (← links)
- Recursive ascent parsing: From Earley to Marcus (Q1200809) (← links)
- Complexity in left-associative grammar (Q1202927) (← links)
- A ''yo-yo'' parsing algorithm for a large class of van Wijngaarden grammars (Q1203603) (← links)
- Processing natural language with schema constraint networks (Q1203675) (← links)
- Automatic correction of syntax-errors in programming languages (Q1211841) (← links)
- The Earley algorithm as a problem representation (Q1212802) (← links)
- Efficient parsing algorithms for general context-free parsers (Q1215404) (← links)
- Ambiguity and precedence in syntax description (Q1216941) (← links)
- A syntactic approach to fingerprint pattern recognition (Q1222517) (← links)
- LR-parsing of extended context free grammars (Q1225465) (← links)
- Sequentielle Analyse kontextfreier Sprachen (Q1226393) (← links)
- Characteristic parsing: A framework for producing compact deterministic parsers. I (Q1240564) (← links)
- Characteristic parsing: A framework for producing compact deterministic parsers. II (Q1240565) (← links)
- Classes of formal grammars (Q1248342) (← links)
- Recursive query processing: The power of logic (Q1262144) (← links)
- Chart parsing of scattered context grammars (Q1324440) (← links)
