Lazy Combinators for Executable Specifications of General Attribute Grammars

Hafiz, Rahmatullah; Frost, Richard A.

doi:10.1007/978-3-642-11503-5_15

Cited by 6 publications

(4 citation statements)

References 23 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Forming Arbitrary Dependency: In [18], authors demonstrated how semantics rules can be integrated with CFGs' syntax in top-down parsing by describing the implementation of combinators in the purely functional language Haskell to enable the formation of modular language specifications. The new parser (from now on we shall refer non-terminals of AGs as parsers) now has a set of attributes, which are computed from other terminals/non-terminals' attributes that belong to the current parser's syntax definition(s).…”

Section: Declarative and Executable Attribute Grammarsmentioning

confidence: 99%

Modular Natural Language Processing Using Declarative Attribute Grammars

Hafiz

Frost

2011

Advances in Artificial Intelligence

Self Cite

View full text Add to dashboard Buy / Rent full text

Abstract.A system based on a general top-down parsing algorithm has been developed which allows language processors to be created as executable specifications of arbitrary attribute grammars. Declarative notation of attribute grammars allows modular construction of executable language definitions. Syntax is defined through general context-free grammar rules, and meaning is defined by associated semantic rules with arbitrary dependencies. An innovative technique allows parses to be pruned by arbitrary semantic constraints. This new technique is useful in modelling natural-language phenomena by imposing unification-like restrictions, and accommodating long-distance and cross-serial dependencies, which cannot be handled by context-free rules alone.

show abstract

Section: Declarative and Executable Attribute Grammarsmentioning

confidence: 99%

Modular Natural Language Processing Using Declarative Attribute Grammars

Hafiz

Frost

2011

Advances in Artificial Intelligence

Self Cite

View full text Add to dashboard Buy / Rent full text

show abstract

“…We are creating an NL query processor by integrating the semantics with a parser using an executable attribute-grammar environment [8]. The parser will convert the query: "Which gangster who stole a car in 1899 or 1908 joined a gang which was joined by Torrio?"…”

Section: Concluding Comments and Future Workmentioning

confidence: 99%

An Event Based Denotational Semantics for Natural Language Queries to Data Represented in Triple Stores

Frost

Amour

Fortier

2013

2013 IEEE Seventh International Conference on Semantic Computing

Self Cite

View full text Add to dashboard Buy / Rent full text

Binary-relational and graph-based databases are more flexible than conventional relational databases because the type of data to be stored does not need to be known in advance. In many implementations of these systems the data is held in a "triple store". This paper presents a new event-based denotational semantics which can be used as the basis for natural-language (NL) query interfaces to triple stores. This paper is also a first step towards an NL semantics which can be used for building NL query interfaces to RDF semantic web data.

show abstract

“…The requirement on mk symbol is simply that it should be injective on its argument: if mk symbol rhs' = mk symbol rhs then rhs' = rhs 7 . For example, with the current implementation, evaluating mk symbol (Seq(NT "E", NT "E")) returns (NT "(E*E)") 8 .…”

Section: Parsing Combinatorsmentioning

confidence: 99%

“…Experiments showed that this previous approach outperformed Happy on the grammar E EEE, but it seems clear that Happy has poor real-world performance on many such grammars. As described in that paper, the use of a parsing context is related to a long line of work that uses the length of the input to force termination [8]. Grammar extraction from combinator parsers, and the use of a separate back-end parser, was first described in [11].…”

Section: Related Workmentioning

confidence: 99%

Simple, Efficient, Sound and Complete Combinator Parsing for All Context-Free Grammars, Using an Oracle

Ridge

2014

Software Language Engineering

View full text Add to dashboard Buy / Rent full text

Abstract. Parsers for context-free grammars can be implemented directly and naturally in a functional style known as "combinator parsing", using recursion following the structure of the grammar rules. Traditionally parser combinators have struggled to handle all features of context-free grammars, such as left recursion. Previous work introduced novel parser combinators that could be used to parse all context-free grammars. A parser generator built using these combinators was proved both sound and complete in the HOL4 theorem prover.

show abstract

Lazy Combinators for Executable Specifications of General Attribute Grammars

Cited by 6 publications

References 23 publications

Modular Natural Language Processing Using Declarative Attribute Grammars

Modular Natural Language Processing Using Declarative Attribute Grammars

An Event Based Denotational Semantics for Natural Language Queries to Data Represented in Triple Stores

Simple, Efficient, Sound and Complete Combinator Parsing for All Context-Free Grammars, Using an Oracle

Contact Info

Product

Resources

About