archives

Following the Grammar


Home 

About 

Browse 

Search 

Register 

Subscriptions 

Deposit Papers 

Help
    

Leavens, Gary T. (2005) Following the Grammar. Technical Report 05-02, Computer Science, Iowa State University.

Full text available as:Adobe PDF
Postscript

There is a later version of this eprint available: Click here to view it.

Abstract

This document explains what it means to ``follow the grammar'' for several different grammars. It is intended to be used in class that teach functional programming using Scheme, especially those used for teaching principles of programming languages. In such courses traversal is over abstract syntax tree is defined by a grammar are fundamental, since they are the technique used to write compilers and interpreters.

Keywords:Recursion, programming recursive procedures, recursion pattern, inductive definition, BNF grammar, Kleene star, follow the grammar, functional programming, list recursion, programming languages, concrete syntax, abstract syntax, helping procedures, parsing procedures, Scheme.
Comments:Used in Com S 342, Spring 2005.
Subjects:Software: PROGRAMMING TECHNIQUES (E): Applicative (Functional) Programming
Software: SOFTWARE ENGINEERING (K.6.3): Coding Tools and Techniques
Software: PROGRAMMING LANGUAGES: Formal Definitions and Theory (D.2.1, F.3.1-2, F.4.2-3)
Software: PROGRAMMING LANGUAGES: Language Constructs and Features (E.2)
ID code:00000353
Deposited by:Gary T. Leavens on 11 February 2005
Alternative Locations:ftp://ftp.cs.iastate.edu/pub/techreports/TR05-02/TR.pdf ftp://ftp.cs.iastate.edu/pub/techreports/TR05-02/TR.ps.gz

Available Versions of This Paper



Contact site administrator at: ssg@cs.iastate.edu