Two recent developments in the field of formal languages are Parsing Expression Grammar (PEG) and packrat parsing. The PEG formalism is similar to BNF, but defines syntax in terms of recognizingâ€¦ (More)

Parsing Expression Grammar (PEG) is a new way to specify syntax, by means of a top-down process with limited backtracking. It can be directly transcribed into a recursive-descent parser. The parserâ€¦ (More)

Parsing Expression Grammar (PEG) is a way to define a recursive-descent parser with limited backtracking. Its properties are useful in many applications. In spite of its apparent similarity toâ€¦ (More)

Languages with infinite words have often been studied as subsets of a topological space. The topology used for this purpose was always the natural topology of sequences. This paper suggests thatâ€¦ (More)

A description is given of how a tree representing the evaluation of an arithmetic expression can be drawn in such a way that the number of accumulators needed for the computation can be representedâ€¦ (More)

This is a short note inspired by some ideas and results from [3,6â€“8]. It is about Parsing Expression Grammars (PEGs) introduced by Ford in [1]. PEG specifies a language by defining for it a parserâ€¦ (More)

Parsing Expression Grammar (PEG) encodes a recursive-descent parser with limited backtracking. The parser has many useful properties. Converting PEG to an executable parser is a ratherâ€¦ (More)

In an earlier paper, the author used derivatives to construct a deterministic automaton recognizing the language defined by an Ï‰-regular expression. The construction was related to a determinizationâ€¦ (More)

In an earlier paper, the author adapted to Parsing Expression Grammars (PEGs) the properties FIRST and FOLLOW used in the construction of predictive top-down parsers. The purpose was to obtainâ€¦ (More)