Results 211 to 220 of about 2,336,780 (253)
Looking back and to the future after four-plus years of language in chemistry.
Digit DiscovHocky GM, White AD.
europepmc +1 more source
Unified down-stream analysis of crosslinking mass spectrometry results with pyXLMS
Birklbauer MJ +7 more
europepmc +1 more source
Producing a top-down parse order with bottom-up parsing
Information Processing Letters, 1995 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
David T Barnard
exaly +3 more sources
Top-Down Online Handwritten Mathematical Expression Parsing with Graph Grammar
Lecture Notes in Computer Science, 2015 In recognition of online handwritten mathematical expressions, symbol segmentation and classification and recognition of relations among symbols is managed through a parsing technique. Most parsing techniques follow a bottom-up approach and adapt grammars typically used to parse strings.
Harold Mouchère +2 more
exaly +4 more sources
TOP-DOWN PARSING WITH SIMULTANEOUS EVALUATION OF NONCIRCULAR ATTRIBUTE GRAMMARS [PDF]
Fundamenta Informaticae, 1994 This paper introduces a machinery called attributed top–down parsing automaton which performs top-down parsing of strings and, simultaneously, the evaluation of arbitrary noncircular attribute grammars. The strategy of the machinery is based on a single depth–first left–to–right traversal over the syntax tree.
Thomas Noll +2 more
exaly +4 more sources
Some of the next articles are maybe not open access.
Related searches:
Related searches:
A translation machine with automated top-down parsing
ACM SIGPLAN Notices, 1976The top-down method of parsing programming languages has been widely used in commercially available compilers. Suprisingly, techniques for automating syntax-directed, top-down parsing have not been <u>widely</u> available. This paper describes a practical top-down parsing method which is a part of a general purpose <u>translation ...
Harold W Lawson
exaly +3 more sources
A Top-Down Model for Character-Level Chinese Dependency Parsing
Lecture Notes in Computer Science, 2019This paper proposes a novel transition-based algorithm for character-level Chinese dependency parsing that straightforwardly models the dependency tree in a top-down manner. Based on the stack-pointer parser, we joint Chinese word segmentation, part-of-speech tagging, and dependency parsing in a new way.
Xu Jinan
exaly +3 more sources
1994
Wir entwickeln in diesem Kapitel zunachst ein Schema zur Top-down-Analyse von Satzen, das wir anschliesend schrittweise zu einem Erkennungs- und einem Parsingalgorithmus erweitern. Dabei wird gezeigt, wie bei einer Top-down-Analyse entweder die Depth-first-Suche mit Backtracking oder die Breadth-first-Suche verwendet werden kann.
Sven Naumann, Hagen Langer
openaire +1 more source
Wir entwickeln in diesem Kapitel zunachst ein Schema zur Top-down-Analyse von Satzen, das wir anschliesend schrittweise zu einem Erkennungs- und einem Parsingalgorithmus erweitern. Dabei wird gezeigt, wie bei einer Top-down-Analyse entweder die Depth-first-Suche mit Backtracking oder die Breadth-first-Suche verwendet werden kann.
Sven Naumann, Hagen Langer
openaire +1 more source
1984
In trying to parse a string with a grammar, if one starts with the grammar and tries to fit it to the string, this is top-down parsing. For instance with a context-free grammar . one starts with expansions for the initial symbol, and builds down from there trying to find an expansion which will get to the symbols in the string.
Alan Bundy, Lincoln Wallen
openaire +1 more source
In trying to parse a string with a grammar, if one starts with the grammar and tries to fit it to the string, this is top-down parsing. For instance with a context-free grammar . one starts with expansions for the initial symbol, and builds down from there trying to find an expansion which will get to the symbols in the string.
Alan Bundy, Lincoln Wallen
openaire +1 more source