You can not select more than 25 topics Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.
 
 
 
 
 
 

89 lines
3.1 KiB

##
## tinyap.spec -- OpenPKG RPM Package Specification
## Copyright (c) 2000-2022 OpenPKG Project <http://openpkg.org/>
##
## Permission to use, copy, modify, and distribute this software for
## any purpose with or without fee is hereby granted, provided that
## the above copyright notice and this permission notice appear in all
## copies.
##
## THIS SOFTWARE IS PROVIDED ``AS IS'' AND ANY EXPRESSED OR IMPLIED
## WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF
## MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.
## IN NO EVENT SHALL THE AUTHORS AND COPYRIGHT HOLDERS AND THEIR
## CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
## SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
## LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF
## USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND
## ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY,
## OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT
## OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
## SUCH DAMAGE.
##
# package version
%define V_opkg 1.4.0
%define V_dist 1.4-0
# package information
Name: tinyap
Summary: Recursive Descent Parser and Abstract Syntax Tree Walker
URL: http://code.google.com/p/tinyap/
Vendor: Damien Leroux
Packager: OpenPKG Project
Distribution: OpenPKG Community
Class: EVAL
Group: CompilerCompiler
License: GPL
Version: %{V_opkg}
Release: 20080512
# list of sources
Source0: http://tinyap.googlecode.com/files/tinyap-%{V_dist}.tar.gz
Patch0: tinyap.patch
# build information
BuildPreReq: OpenPKG, openpkg >= 20160101
PreReq: OpenPKG, openpkg >= 20160101
%description
This is not yet another parser. Tinyap takes some text and an a
grammar describing AST as inputs, and outputs another AST that
describes the text contents, according to the provided grammar.
Basically, tinyap is a recursive descent parser with backup.
Thus, it's able to recognize any LL(k) language. When a parse is
successful, tinyap outputs an Abstract Syntax Tree (AST) that
represents the input text in a structured manner. Unlike most
parsers, its code isn't factory-calibrated for a particular grammar.
Instead, the grammar is data. Tinyap uses an AST that represents
a grammar to parse its input text. This grammar AST is structured
according to tinyap's grammar description language.
%track
prog tinyap = {
version = %{V_dist}
url = http://code.google.com/p/tinyap/
regex = tinyap-(__VER__)\.tar\.gz
}
%prep
%setup -q -n tinyap-%{V_dist}
%patch -p0
%build
CC="%{l_cc}" \
CFLAGS="%{l_cflags -O}" \
./configure \
--prefix=%{l_prefix} \
--disable-shared
%{l_make} %{l_mflags -O}
%install
%{l_make} %{l_mflags} install AM_MAKEFLAGS="DESTDIR=$RPM_BUILD_ROOT"
strip $RPM_BUILD_ROOT%{l_prefix}/bin/* >/dev/null 2>&1 || true
%{l_rpmtool} files -v -ofiles -r$RPM_BUILD_ROOT %{l_files_std}
%files -f files
%clean