2011•Unpublished venueRequires access

Context‐Free Grammars, Part 3

Anthony J. Dos Reis

Abstract

This chapter contains sections titled: Introduction Grammars for Arithmetic Expressions Specifying Associativity and Precedence in Grammars Backus-Naur Form Syntax Diagrams Abstract Syntax Trees and Three-Address Code Noncontracting Grammars Essentially Noncontracting Grammars Converting a Context-Free Grammar to an Essentially Noncontracting Grammar Pumping Property of Context-Free Languages (Optional) Problems

About this research paper

What this paper is about

Why it matters

A significance statement is not available in the OpenAlex record.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

Key concepts: Tree-adjoining grammar, Extended Affix Grammar, L-attributed grammar, Context-sensitive grammar, Indexed grammar, Context-free grammar, Programming language, Computer science