Using information flow to analyze grammars

Authors:
Larry Morell;David Middleton
Affiliations:
Arkansas Tech University, Russellville, AR;Arkansas Tech University, Russellville, AR
Venue:
Journal of Computing Sciences in Colleges
Year:
2010

Citing 3
Cited 2

Crafting a compiler with C

Crafting a compiler with C
Data Flow Analysis in Software Reliability

ACM Computing Surveys (CSUR)
The Theory of Parsing, Translation, and Compiling

The Theory of Parsing, Translation, and Compiling

How to deliver a gentle introduction to parsing: conference tutorial

Journal of Computing Sciences in Colleges
How to deliver a gentle introduction to LR parsing

Journal of Computing Sciences in Colleges

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper presents algorithms for analyzing grammars using information flow in a graph. A grammar problem is modeled by an annotated graph. Information is then propagated around the graph and the problem solution is extracted from the graph's final state. By using this approach students need learn only one generic algorithm (information flow analysis), which they then can apply to several problems Teachers are able to develop problems to be solved directly from the graphs, thereby simplifying the task of generating grammars with required properties for homework and exams.