6533b830fe1ef96bd1297925

RESEARCH PRODUCT

Context-free Languages

Seppo SippuEljas Soisalon-soininen

subject

Class (computer programming)ParsingGrammarComputer scienceProgramming languagemedia_common.quotation_subjectContext-free languagecomputer.software_genreTheoryofComputation_MATHEMATICALLOGICANDFORMALLANGUAGESRule-based machine translationSymbol (programming)Subject (grammar)Rewritingcomputermedia_common

description

In this chapter we shall define a class of rewriting systems called context-free grammars. The left-hand side of a rule in a context-free grammar consists of a single symbol, so that symbols are rewritten “context-freely”. Context-free grammars are of central importance to us because they define the class of context-free languages, the parsing of which is the subject of this book. In this chapter we shall consider some structural properties of context-free grammars which are of importance in parsing. Also, a basic method for recognizing context-free languages will be given.

yearjournalcountryeditionlanguage
1988-01-01
https://doi.org/10.1007/978-3-642-61345-6_4