A flexible parsing engine for Lindenmayer systems

  • Authors:
  • J. Mitchell Haile, II

  • Affiliations:
  • The College of Wooster, 720 Winter Street, Wooster OH

  • Venue:
  • Journal of Computing Sciences in Colleges
  • Year:
  • 2002

Quantified Score

Hi-index 0.00

Visualization

Abstract

This abstract introduces a new conceptual model for interpreting Lindenmayer System grammars in terms of attribute grammars and the associated parse tree structures. A Lindenmayer System (also known as an L-System) is a system of production rules to create character strings that may be interpreted as lines and curves, thus creating a graphical representation of the character string. L-Systems were invented by Aristad Lindenmayer [3] as a tool to describe the branching patterns of plants, and have gained much popularity in this vein for the use of creating graphical images for biological and visual realism purposes [1,2].