Results 41 to 50 of about 146,311 (198)
Adaptable Parsing Expression Grammars [PDF]
, 2012 The term "extensible language" is especially used when a language allows the extension of its own concrete syntax and the definition of the semantics of new constructs. Most popular tools designed for automatic generation of syntactic analyzers do not offer any desirable resources for the specification of extensible languages.
Leonardo V. S. Reis +3 more
openaire +2 more sources
Interworking technology of neural network and data among deep learning frameworks
ETRI Journal, 2019 Based on the growing demand for neural network technologies, various neural network inference engines are being developed. However, each inference engine has its own neural network storage format.
Jaebok Park +4 more
doaj +1 more source
arXiv, 2022 This paper presents an extension of the GLL parsing algorithm for context-free grammars which also supports parsing expression grammars with ordered choice and lookahead. The new PEGLL algorithm retains support for unordered choice, and thus parses a common superset of context-free grammars and parsing expression grammars.
arxiv
Grammars for Indentation-Sensitive Parsing [PDF]
, 2017 Adams\u27 extension of parsing expression grammars enables specifying indentation sensitivity using two non-standard grammar constructs - indentation by a binary relation and alignment. This paper is a theoretical study of Adams\u27 grammars. It proposes
core +1 more source
Lake symbols for island parsing [PDF]
The Art, Science, and Engineering of Programming, 2021, Vol. 5,
Issue 2, Article 11, 2020 Context: An island parser reads an input text and builds the parse (or abstract syntax) tree of only the programming constructs of interest in the text. These constructs are called islands and the rest of the text is called water, which the parser ignores and skips over.
arxiv +1 more source
Recovering Grammar Relationships for the Java Language Specification [PDF]
, 2010 Grammar convergence is a method that helps discovering relationships between different grammars of the same language or different language versions.
A. Dubey +10 more
core +7 more sources
Grammar Prompting for Domain-Specific Language Generation with Large Language Models [PDF]
arXiv, 2023 Large language models (LLMs) can learn to perform a wide range of natural language tasks from just a handful of in-context examples. However, for generating strings from highly structured languages (e.g., semantic parsing to complex domain-specific languages), it is challenging for the LLM to generalize from just a few exemplars.
arxiv
FliPpr: A Prettier Invertible Printing System [PDF]
, 2013 When implementing a programming language, we often write a parser and a pretty-printer. However, manually writing both programs is not only tedious but also error-prone; it may happen that a pretty-printed result is not correctly parsed. In this paper,
A. Kühnemann +11 more
core +3 more sources
Further Exploration of the Fluency Corpus of Academic English Lectures: The Profile of Repetitions
TESOL Quarterly, EarlyView.Abstract In assessment contexts, the domain definition inference requires accurate documentation of linguistic demands in a specific target domain for precise measurement. The present study examines several aspects of repetitions in academic lecture settings to offer the domain definition inference for academic listening tests.
Hitoshi Nishizawa
wiley +1 more source
The ModelCC Model-Driven Parser Generator
, 2015 Syntax-directed translation tools require the specification of a language by means of a formal grammar. This grammar must conform to the specific requirements of the parser generator to be used.
Berzal, Fernando +3 more
core +2 more sources