- Add LICENSE

- Switch to USES=tar
- Add NO_ARCH
- Switch to options helpers
- Pet portlint
This commit is contained in:
Dmitry Marakasov 2016-04-28 09:03:22 +00:00
parent 3c240de5dc
commit 1731abc29f
Notes: svn2git 2021-03-31 03:12:20 +00:00
svn path=/head/; revision=414165
2 changed files with 21 additions and 17 deletions

View file

@ -7,27 +7,31 @@ PORTREVISION= 3
CATEGORIES= textproc
MASTER_SITES= http://www.oualline.com/sw/re/
DISTNAME= ${PORTNAME:S/_/-/}_${PORTVERSION:S/.//}
EXTRACT_SUFX= .tar
MAINTAINER= ports@FreeBSD.org
COMMENT= Regular Expression Graphing Program
LICENSE= GPLv2
LICENSE_FILE= ${WRKSRC}/COPYING
RUN_DEPENDS= p5-GD>=0:graphics/p5-GD \
p5-GD-Arrow>=0:graphics/p5-GD-Arrow
USES= perl5
USES= tar perl5
USE_PERL5= run
NO_WRKSUBDIR= yes
NO_BUILD= yes
USE_PERL5= run
NO_ARCH= yes
PLIST_FILES= bin/re_graph
PORTDOCS= *
OPTIONS_DEFINE= DOCS
PORTDOCS= *
do-install:
${INSTALL_SCRIPT} ${WRKSRC}/re_graph.pl ${STAGEDIR}${PREFIX}/bin/re_graph
do-install-DOCS-on:
@${MKDIR} ${STAGEDIR}${DOCSDIR}
${INSTALL_DATA} ${WRKSRC}/re_graph.html ${STAGEDIR}${DOCSDIR}
${INSTALL_DATA} ${WRKSRC}/tut* ${STAGEDIR}${DOCSDIR}

View file

@ -1,17 +1,17 @@
The re_graph.pl program graphs regular expressions. The guts of the regular
expression engine is a simple state machine. The various states and operations
in the regular expression parser can be displayed using a surprisingly simple
diagram.
expression engine is a simple state machine. The various states and
operations in the regular expression parser can be displayed using a
surprisingly simple diagram.
A few notes on what you are looking at:
* The nodes Start and Stop denote the beginning and end of the regular
expression.
* The solid squares denote atoms. Lines indicate the next state. When a
line splits, the state machine will take the top line first. If it's
path is blocked it will backup and take the next lower line. This is
repeated until it finds a path to the end or all paths are exhausted.
* Brown boxes indicate a grouping operation, i.e. ().
* Green boxes indicate a zero with test. The state machine will perform the
test inside the box before moving ahead.
* The nodes Start and Stop denote the beginning and end of the regular
expression.
* The solid squares denote atoms. Lines indicate the next state. When a
line splits, the state machine will take the top line first. If it's
path is blocked it will backup and take the next lower line. This is
repeated until it finds a path to the end or all paths are exhausted.
* Brown boxes indicate a grouping operation, i.e. ().
* Green boxes indicate a zero with test. The state machine will perform
the test inside the box before moving ahead.
WWW: http://www.oualline.com/sw/