Results 151 to 160 of about 7,184 (201)

Parsing Transformative LR(1) Languages

, 2006
Blake Hegerle
openalex   +2 more sources

LR(1) Parser Generation System: LR(1) Error Recovery, Oracles, and Generic Tokens

, 2010
A. Sorkin, Peter Donovan
openalex   +2 more sources

Discovering Social Determinants of Health from Case Reports using Natural Language Processing: Algorithmic Development and Validation

, 2022
Raza S, Dolatabadi E, Ondrusek N, Rosella L, Schwartz B.   +4 more
europepmc   +1 more source

The Burnout PRedictiOn Using Wearable aNd ArtIficial IntelligEnce (BROWNIE) study: a decentralized digital health protocol to predict burnout in registered nurses. [PDF]

BMC Nurs
Wilton AR, Sheffield K, Wilkes Q, Chesak S, Pacyna J, Sharp R, Croarkin PE, Chauhan M, Dyrbye LN, Bobo WV, Athreya AP.   +10 more
europepmc   +1 more source

A neural machine translation method based on split graph convolutional self-attention encoding. [PDF]

PeerJ Comput Sci
Wan F, Li P.
europepmc   +1 more source

An empirical study of fault localisation techniques for deep neural networks. [PDF]

Empir Softw Eng
Humbatova N, Kim J, Jahangirova G, Yoo S, Tonella P.   +4 more
europepmc   +1 more source

Some of the next articles are maybe not open access.

Related searches:

LR—Automatic Parser Generator and LR(1) Parser

IEEE Transactions on Software Engineering, 1981
LR is an LR(1) parser generation system. It is written entirely in portable ANS1 standard Fortran 66 and has been successfully operated on a number of computers. LR uses a powerful algorithm of Pager's to generate a space efficient parser for any LR(1) grammar.
C. Wetherell, A. Shannon
openaire   +2 more sources

DR parsers: a generalization of LR parsers

Proceedings of the 1990 IEEE Workshop on Visual Languages, 2002
A method is presented to construct a parser for a visual language whose specification can be done by a context-free grammar. The main idea is to allow a traditional LR parser to choose the next symbol to parse from a two-dimensional space. The positional grammar is defined, and some examples are given.
Costagliola G., Chang S. K.
openaire   +3 more sources

Looping LR parsers

Information Processing Letters, 1988
Abstract An LR parser generated from an arbitrary grammar may be looping. A characterization is given for grammars that will never produce a looping LR parser. A testing algorithm is outlined, and its time complexity is analyzed.
Jorma Tarhio, Eljas Soisalon-Soininen
openaire   +2 more sources