2018-09-26 21:42:16 +00:00
|
|
|
%global pypi_name lark-parser
|
|
|
|
|
|
|
|
Name: python-%{pypi_name}
|
|
|
|
Version: 0.6.4
|
2019-02-02 07:31:55 +00:00
|
|
|
Release: 3%{?dist}
|
2018-09-26 21:42:16 +00:00
|
|
|
Summary: Lark is a modern general-purpose parsing library for Python
|
|
|
|
License: MIT
|
|
|
|
Url: https://github.com/lark-parser/lark
|
|
|
|
Source: https://files.pythonhosted.org/packages/source/l/%{pypi_name}/%{pypi_name}-%{version}.tar.gz
|
|
|
|
BuildArch: noarch
|
|
|
|
|
|
|
|
%description
|
|
|
|
Lark is a modern general-purpose parsing library for Python.
|
|
|
|
|
|
|
|
Lark focuses on simplicity and power. It lets you choose between
|
|
|
|
two parsing algorithms:
|
|
|
|
|
|
|
|
Earley : Parses all context-free grammars (even ambiguous ones)!
|
|
|
|
It is the default.
|
|
|
|
|
|
|
|
LALR(1): Only LR grammars. Outperforms PLY and most if not all
|
|
|
|
other pure-python parsing libraries.
|
|
|
|
|
|
|
|
Both algorithms are written in Python and can be used interchangeably
|
|
|
|
with the same grammar (aside for algorithmic restrictions).
|
|
|
|
See "Comparison to other parsers" for more details.
|
|
|
|
|
|
|
|
Lark can auto magically build an AST from your grammar, without any
|
|
|
|
more code on your part.
|
|
|
|
|
|
|
|
Features:
|
|
|
|
|
|
|
|
- EBNF grammar with a little extra
|
|
|
|
- Earley & LALR(1)
|
|
|
|
- Builds an AST auto magically based on the grammar
|
|
|
|
- Automatic line & column tracking
|
|
|
|
- Automatic token collision resolution (unless both tokens are regexps)
|
|
|
|
- Python 2 & 3 compatible
|
|
|
|
- Unicode fully supported
|
|
|
|
|
2019-01-11 00:17:54 +00:00
|
|
|
%package -n python3-%{pypi_name}
|
|
|
|
Summary: %{summary}
|
|
|
|
BuildRequires: python3-devel
|
|
|
|
%{?python_provide:%python_provide python3-%{pypi_name}}
|
|
|
|
|
|
|
|
%description -n python3-%{pypi_name}
|
|
|
|
Lark is a modern general-purpose parsing library for Python.
|
|
|
|
|
|
|
|
Lark focuses on simplicity and power. It lets you choose between
|
|
|
|
two parsing algorithms:
|
|
|
|
|
|
|
|
Earley : Parses all context-free grammars (even ambiguous ones)!
|
|
|
|
It is the default.
|
|
|
|
|
|
|
|
LALR(1): Only LR grammars. Outperforms PLY and most if not all
|
|
|
|
other pure-python parsing libraries.
|
|
|
|
|
|
|
|
Both algorithms are written in Python and can be used interchangeably
|
|
|
|
with the same grammar (aside for algorithmic restrictions).
|
|
|
|
See "Comparison to other parsers" for more details.
|
|
|
|
|
|
|
|
Lark can auto magically build an AST from your grammar, without any
|
|
|
|
more code on your part.
|
|
|
|
|
|
|
|
Features:
|
|
|
|
|
|
|
|
- EBNF grammar with a little extra
|
|
|
|
- Earley & LALR(1)
|
|
|
|
- Builds an AST auto magically based on the grammar
|
|
|
|
- Automatic line & column tracking
|
|
|
|
- Automatic token collision resolution (unless both tokens are regexps)
|
|
|
|
- Python 2 & 3 compatible
|
|
|
|
- Unicode fully supported
|
|
|
|
|
2018-09-26 21:42:16 +00:00
|
|
|
%prep
|
|
|
|
%autosetup -n %{pypi_name}-%{version}
|
|
|
|
|
|
|
|
%build
|
|
|
|
%py3_build
|
|
|
|
|
|
|
|
%install
|
|
|
|
%py3_install
|
|
|
|
|
2019-01-11 00:17:54 +00:00
|
|
|
%files -n python3-%{pypi_name}
|
2018-09-26 21:42:16 +00:00
|
|
|
%license LICENSE
|
|
|
|
%doc README.md examples
|
|
|
|
%{python3_sitelib}/lark_parser-*.egg-info
|
|
|
|
%{python3_sitelib}/lark/
|
|
|
|
|
|
|
|
%changelog
|
2019-02-02 07:31:55 +00:00
|
|
|
* Sat Feb 02 2019 Fedora Release Engineering <releng@fedoraproject.org> - 0.6.4-3
|
|
|
|
- Rebuilt for https://fedoraproject.org/wiki/Fedora_30_Mass_Rebuild
|
|
|
|
|
2019-01-11 00:17:54 +00:00
|
|
|
* Fri Jan 11 2019 Thomas Andrejak <thomas.andrejak@gmail.com> - 0.6.4-2
|
|
|
|
- Fix package naming
|
|
|
|
|
2018-09-26 21:42:16 +00:00
|
|
|
* Mon Sep 24 2018 Thomas Andrejak <thomas.andrejak@gmail.com> - 0.6.4-1
|
|
|
|
- Initial package
|