The domain of context-free languages has been extensively explored and there exist numerous techniques for parsing (all or a subset of) context-free languages. Unfortunately, some programming languages are not context-free. Using standard context-free parsing techniques to parse a context-sensitive programming language poses a considerable challenge. Im- plementors of programming language parsers have adopted various techniques, such as hand-written parsers, special lex- ers, or post-processing of an ambiguous parser output to deal with that challenge. In this paper we suggest a simple extension of a top-down parser with contextual information. Contrary to the tradi- tional approach that uses only the input stream as an input to a parsing f...
In this paper we approach the following problem: Given an arbitrary language describing device (e.g....
I would like to thank my supervisor Jan Kurs ̌ for his steady input of new ideas – Prof. Oscar Niers...
Abstract. The theory of context-free languages is well-understood and context-free parsers can be us...
Despite the long history of research in parsing, constructing parsers for real programming languages...
Context-free grammar is a fundamental tool in software technologies. It is present in almost all asp...
Parsing efficiency is crucial when building practical natural language systems. This paper introduce...
Parsing is the process of assigning structure to sentences. The structure is obtained from the gramm...
Extended context-free grammars are context-free grammars in which the right-hand sides of production...
This thesis presents the design and implementation of practical general top-down parsers. Top-down p...
Parsing is the process of analysing an input string in order to extract a structured representation ...
Parser combinators are a popular approach to parsing where contextfree grammars are represented as e...
Historically, true context-sensitive parsing has seldom been applied to programming languages, due t...
Parsing efficiency is crucial when building practical natural language systems. This paper introduce...
Parsers for context-free grammars can be implemented directly and naturally in a functional style kn...
Context-Free grammars have several features which make them suitable for defining programming langua...
In this paper we approach the following problem: Given an arbitrary language describing device (e.g....
I would like to thank my supervisor Jan Kurs ̌ for his steady input of new ideas – Prof. Oscar Niers...
Abstract. The theory of context-free languages is well-understood and context-free parsers can be us...
Despite the long history of research in parsing, constructing parsers for real programming languages...
Context-free grammar is a fundamental tool in software technologies. It is present in almost all asp...
Parsing efficiency is crucial when building practical natural language systems. This paper introduce...
Parsing is the process of assigning structure to sentences. The structure is obtained from the gramm...
Extended context-free grammars are context-free grammars in which the right-hand sides of production...
This thesis presents the design and implementation of practical general top-down parsers. Top-down p...
Parsing is the process of analysing an input string in order to extract a structured representation ...
Parser combinators are a popular approach to parsing where contextfree grammars are represented as e...
Historically, true context-sensitive parsing has seldom been applied to programming languages, due t...
Parsing efficiency is crucial when building practical natural language systems. This paper introduce...
Parsers for context-free grammars can be implemented directly and naturally in a functional style kn...
Context-Free grammars have several features which make them suitable for defining programming langua...
In this paper we approach the following problem: Given an arbitrary language describing device (e.g....
I would like to thank my supervisor Jan Kurs ̌ for his steady input of new ideas – Prof. Oscar Niers...
Abstract. The theory of context-free languages is well-understood and context-free parsers can be us...