Journal Article10.1145/321138.321145
On The Ambiguity Problem of Backus Systems
79
TL;DR: Backus has developed an elegant method of defining well-formed formulas for computer languages such as ALGOL that consists of a finite sequence of letters from the alphabet.
read more
Abstract: Backus [1] has developed an elegant method of defining well-formed formulas for computer languages such as ALGOL. It consists of (our notation is slightly different from that of Backus): A finite alphabet: a1, a2, …, at;Predicates: P1, P2, …, Pϵ;Productions, either of the form (a) aj ∈ Pi;
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
Ambiguity functions of context-free grammars and languages
Klaus Wich
- 01 Jan 2005
TL;DR: This thesis considers the (sequential) Earley parsing time of context-free grammars with sublinear ambiguity functions (known to exist due to result 3) and it is shown that each reduced context- free grammar with a polynomially bounded ambiguity can be parsed in logarithmic time on a CREW-PRAM.
Pure and declarative syntax definition
TL;DR: In this paper, the authors discuss the role of syntax definitions in modern software systems, and serve as the basis for language processing tools like parsers and compilers, such as compilers.
9
Programming Language Processors
TL;DR: A programming language processor is a formal method for translating from any specified programming language to machine language as discussed by the authors, and it is considered a formal approach for translating any programming language into machine language.
9
•Dissertation
Approximating Context-Free Grammars for Parsing and Verification
Sylvain Schmitz
- 24 Sep 2007
TL;DR: The grammar approximation technique discussed in the thesis is applied to nondeterminism and ambiguity issues in two different ways, one for the generation of noncanonical parsers, and the other for ambiguity detection in itself, with the insurance that a grammar reported as unambiguous is actually so.
9
References
Report on the algorithmic language ALGOL 60
J. W. Backus,Friedrich L. Bauer,J. Green,C. Katz,John J. McCarthy,Alan J. Perlis,Heinz Rutishauser,K. Samelson,B. Vauquois,J. H. Wegstein,A. van Wijngaarden,M. Woodger,Peter Naur +12 more
TL;DR: It was decided to hold an international meeting in January 1960 for improving the ALGOL language and preparing a final report, and seven representatives were selected to attend the January 1960 international conference.
577