d06a3bdc67
based upon the pkg provided by Michal Pasternak in PR 21982 TPG can very simply write parsers that are usefull for most every day needs (even if it can't make your coffee). With a very clear and simple syntax, you can write an attributed grammar that is translated into a recursive descendant parser. TPG generated code is very closed to the original grammar. This means that the parser works "like" the grammar. A grammar rule can be seen as a method of the parser class, symbols as method calls, attributes as method parameters and semantic values as return values. You can also add Python code directly into grammar rules and build abstract syntax trees while parsing.
18 lines
519 B
Text
18 lines
519 B
Text
@comment $NetBSD: PLIST,v 1.1.1.1 2003/09/15 22:08:35 recht Exp $
|
|
bin/tpg
|
|
${PYSITELIB}/tpg/Release.py
|
|
${PYSITELIB}/tpg/Release.pyc
|
|
${PYSITELIB}/tpg/Release.pyo
|
|
${PYSITELIB}/tpg/__init__.py
|
|
${PYSITELIB}/tpg/__init__.pyc
|
|
${PYSITELIB}/tpg/__init__.pyo
|
|
${PYSITELIB}/tpg/base.py
|
|
${PYSITELIB}/tpg/base.pyc
|
|
${PYSITELIB}/tpg/base.pyo
|
|
${PYSITELIB}/tpg/codegen.py
|
|
${PYSITELIB}/tpg/codegen.pyc
|
|
${PYSITELIB}/tpg/codegen.pyo
|
|
${PYSITELIB}/tpg/parser.py
|
|
${PYSITELIB}/tpg/parser.pyc
|
|
${PYSITELIB}/tpg/parser.pyo
|
|
@dirrm ${PYSITELIB}/tpg
|