1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
|
%global _empty_manifest_terminate_build 0
Name: python-LEPL
Version: 5.1.3
Release: 1
Summary: A Parser Library for Python 2.6+/3+: Recursive Descent; Full Backtracking
License: UNKNOWN
URL: http://www.acooke.org/lepl/
Source0: https://mirrors.nju.edu.cn/pypi/web/packages/bb/89/5acd0982ca17258d13df855114364140712ac59ccdb835093c385ddc8dca/LEPL-5.1.3.tar.gz
BuildArch: noarch
%description
* **Parsers are Python code**, defined in Python itself. No separate
grammar is necessary.
* **Friendly syntax** using Python's operators allows grammars
to be defined in a declarative style close to BNF.
* Integrated, optional **lexer** simplifies handling whitespace.
* Built-in **AST support** with support for iteration, traversal and
re--writing.
* Generic, pure-Python approach supports parsing a wide variety of data
including **bytes** (Python 3+ only).
* **Well documented** and easy to extend.
* **Unlimited recursion depth**. The underlying algorithm is
recursive descent, which can exhaust the stack for complex grammars
and large data sets. LEPL avoids this problem by using Python
generators as coroutines (aka "trampolining").
* **Parser rewriting**. The parser can itself be manipulated by
Python code. This gives unlimited opportunities for future
expansion and optimisation.
* Support for ambiguous grammars (**complete backtracking**). A
parser can return more than one result (aka **"parse forests"**).
* Parsers can be made more **efficient** with automatic memoisation ("packrat
parsing").
* Memoisation can detect and control **left-recursive grammars**. Together
with LEPL's support for ambiguity this means that "any" grammar can be
supported.
* Trace and resource management, including **"deepest match" diagnostics**
and the ability to limit backtracking.
%package -n python3-LEPL
Summary: A Parser Library for Python 2.6+/3+: Recursive Descent; Full Backtracking
Provides: python-LEPL
BuildRequires: python3-devel
BuildRequires: python3-setuptools
BuildRequires: python3-pip
%description -n python3-LEPL
* **Parsers are Python code**, defined in Python itself. No separate
grammar is necessary.
* **Friendly syntax** using Python's operators allows grammars
to be defined in a declarative style close to BNF.
* Integrated, optional **lexer** simplifies handling whitespace.
* Built-in **AST support** with support for iteration, traversal and
re--writing.
* Generic, pure-Python approach supports parsing a wide variety of data
including **bytes** (Python 3+ only).
* **Well documented** and easy to extend.
* **Unlimited recursion depth**. The underlying algorithm is
recursive descent, which can exhaust the stack for complex grammars
and large data sets. LEPL avoids this problem by using Python
generators as coroutines (aka "trampolining").
* **Parser rewriting**. The parser can itself be manipulated by
Python code. This gives unlimited opportunities for future
expansion and optimisation.
* Support for ambiguous grammars (**complete backtracking**). A
parser can return more than one result (aka **"parse forests"**).
* Parsers can be made more **efficient** with automatic memoisation ("packrat
parsing").
* Memoisation can detect and control **left-recursive grammars**. Together
with LEPL's support for ambiguity this means that "any" grammar can be
supported.
* Trace and resource management, including **"deepest match" diagnostics**
and the ability to limit backtracking.
%package help
Summary: Development documents and examples for LEPL
Provides: python3-LEPL-doc
%description help
* **Parsers are Python code**, defined in Python itself. No separate
grammar is necessary.
* **Friendly syntax** using Python's operators allows grammars
to be defined in a declarative style close to BNF.
* Integrated, optional **lexer** simplifies handling whitespace.
* Built-in **AST support** with support for iteration, traversal and
re--writing.
* Generic, pure-Python approach supports parsing a wide variety of data
including **bytes** (Python 3+ only).
* **Well documented** and easy to extend.
* **Unlimited recursion depth**. The underlying algorithm is
recursive descent, which can exhaust the stack for complex grammars
and large data sets. LEPL avoids this problem by using Python
generators as coroutines (aka "trampolining").
* **Parser rewriting**. The parser can itself be manipulated by
Python code. This gives unlimited opportunities for future
expansion and optimisation.
* Support for ambiguous grammars (**complete backtracking**). A
parser can return more than one result (aka **"parse forests"**).
* Parsers can be made more **efficient** with automatic memoisation ("packrat
parsing").
* Memoisation can detect and control **left-recursive grammars**. Together
with LEPL's support for ambiguity this means that "any" grammar can be
supported.
* Trace and resource management, including **"deepest match" diagnostics**
and the ability to limit backtracking.
%prep
%autosetup -n LEPL-5.1.3
%build
%py3_build
%install
%py3_install
install -d -m755 %{buildroot}/%{_pkgdocdir}
if [ -d doc ]; then cp -arf doc %{buildroot}/%{_pkgdocdir}; fi
if [ -d docs ]; then cp -arf docs %{buildroot}/%{_pkgdocdir}; fi
if [ -d example ]; then cp -arf example %{buildroot}/%{_pkgdocdir}; fi
if [ -d examples ]; then cp -arf examples %{buildroot}/%{_pkgdocdir}; fi
pushd %{buildroot}
if [ -d usr/lib ]; then
find usr/lib -type f -printf "/%h/%f\n" >> filelist.lst
fi
if [ -d usr/lib64 ]; then
find usr/lib64 -type f -printf "/%h/%f\n" >> filelist.lst
fi
if [ -d usr/bin ]; then
find usr/bin -type f -printf "/%h/%f\n" >> filelist.lst
fi
if [ -d usr/sbin ]; then
find usr/sbin -type f -printf "/%h/%f\n" >> filelist.lst
fi
touch doclist.lst
if [ -d usr/share/man ]; then
find usr/share/man -type f -printf "/%h/%f.gz\n" >> doclist.lst
fi
popd
mv %{buildroot}/filelist.lst .
mv %{buildroot}/doclist.lst .
%files -n python3-LEPL -f filelist.lst
%dir %{python3_sitelib}/*
%files help -f doclist.lst
%{_docdir}/*
%changelog
* Sun Apr 23 2023 Python_Bot <Python_Bot@openeuler.org> - 5.1.3-1
- Package Spec generated
|
