Concept

Comparison of parser generators

Related publications (17)

Graph Chatbot

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.

Accelerating parser combinators with macros

Manohar Jonnalagedda, Eric Beguet

Parser combinators provide an elegant way of writing parsers: parser implementations closely follow the structure of the underlying grammar, while accommodating interleaved host language code for data processing. However, the host language features used fo ...

ACM Press2014

Metamodel-Aware Textual Concrete Syntax Specification

Frédéric Fondement

Metamodeling is raising more and more interest in the field of language engineering. While this approach is now well understood for the definition of abstract syntaxes, the formal definition of concrete syntaxes is still a challenge. Concrete syntaxes are ...

2006

Model Driven Analysis and Synthesis of Concrete Syntax

Frédéric Fondement

Metamodeling is raising more and more interest in the field of language engineering. While this approach is now well understood for defining abstract syntaxes, formally defining concrete syntaxes with metamodels is still a challenge. Concrete syntaxes are ...

2006

Non-deterministic Constructs in OCL -- What does any() Mean

The Object Constraint Language (OCL) offers so-called non-deterministic constructs which are often only poorly understood even by OCL experts. They are widely ignored in the OCL literature, their semantics given in the official language description of OCL ...

Springer2005

Generation of object-oriented programs from CO-OPN specifications

Stanislav Chachkov

The execution of formal specifications is important for verification, validation and animation purposes. This thesis describes transformation of CO-OPN specifications in executable code. The original goal of this transformation was validation by prototypin ...

EPFL2004

Two approaches to Robust Stochastic Parsing

Marita Ailomaa

NLP applications in all domains require more than a formal grammar to process the input in a practical way, because natural language contains phenomena that a formal grammar is usually not able to describe. Such phenomena are typically disfluencies and ext ...

2004

An FPGA-based syntactic parser for large size real-life context-free grammars

Cristian Raul Ciressan

This thesis is at the crossroad between Natural Language Processing (NLP) and digital circuit design. It aims at delivering a custom hardware coprocessor for accelerating natural language parsing. The coprocessor has to parse real-life natural language and ...

EPFL2002