Results 241 to 250 of about 226,863 (285)

Rule-Based Top-Down Parsing for Acyclic Contextual Hyperedge Replacement Grammars

International Conference on Graph Transformation, 2021
F. Drewes, Berthold Hoffmann, M. Minas
semanticscholar   +1 more source

Memory Resource Allocation in Top-Down Minimalist Parsing

2013
This paper provides a linking theory between the minimalist grammar formalism and off-line behavioural data. We examine the transient stack states of a top-down parser for Minimalist Grammars as it analyzes embedded sentences in English, Dutch and German.
John Hale, Gregory M. Kobele, Sabrina Gerth   +2 more
openaire   +2 more sources

Top-down Text-Level Discourse Rhetorical Structure Parsing with Bidirectional Representation Learning

Journal of Computational Science and Technology, 2023
Longyin Zhang, Xin Tan, Fang Kong, Peifeng Li, Guodong Zhou   +4 more
semanticscholar   +1 more source

A unified representation for teaching bottom-up and top-down parsing

Journal of Computing Sciences in Colleges (JCSC; Formerly: Journal of Computing in Small Colleges), 2020
Larry J. Morell, David Middleton
semanticscholar   +1 more source

Top-Down Deterministic Parsing of Languages Generated by CD Grammar Systems

2007
The paper extends the notion of context-free LL(k) grammars to CD grammar systems using two different derivation modes, examines some of the properties of the resulting language families, and studies the possibility of parsing these languages deterministically, without backtracking.
György Vaszil, Henning Bordihn
openaire   +2 more sources

Top-down parsing for Neural Network Exchange Format (NNEF) in TensorFlow-based deep learning computation

International Conference on Information Networking, 2018
Bokyung Seo, Myungjae Shin, Yeong Jong Mo, Joongheon Kim   +3 more
semanticscholar   +1 more source

A top-down no backtrack parsing of general context-free languages

1977
A new parsing algorithm is presented. The algorithm works in a top-down manner and it is easily implementable. The algorithm works for all non left-recursive e-free context-free grammars. For LR(1) left-recursion-free grammars works like an LR(1) push-down acceptor.
openaire   +2 more sources

Deterministic Top-Down Parsing

2008
Dick Grune, Ceriel J. H. Jacobs
openaire   +2 more sources

A new top-down parsing algorithm to accommodate ambiguity and left recursion in polynomial time

SIGP, 2006
R. Frost, R. Hafiz
semanticscholar   +1 more source

Top-Down Parsing of Conjunctive Languages

Grammars, 2002
A. Okhotin
semanticscholar   +1 more source