Did you know ... Search Documentation:
Packs (add-ons) for SWI-Prolog

Package "peg_syntax"

Title:PEG syntax for prolog
Rating:Not rated. Create the first rating!
Latest version:1.0
SHA1 sum:373c74e5da9dfe544634ca0478e3156c5ebe7b64
Author:samlai <piortlierr@gmail.com>
Maintainer:samlai <piortlierr@gmail.com>
Packager:samlai <piortlierr@gmail.com>

Reviews

No reviews. Create the first review!.

Details by download location

VersionSHA1#DownloadsURL
0.1b3d61ba431370ad760e4e7e9bac04c0ecd47b73c4https://github.com/lasamlai/peg_syntax.git
1.0373c74e5da9dfe544634ca0478e3156c5ebe7b643https://github.com/lasamlai/peg_syntax.git

PEG Syntax for the Prolog

This package implement **[PEG]** syntax in [swi-prolog] by [term_expansion/2].

This package adds new operators:

PrecedenceTypeNameDescription
1200xfx<--Rule
1105xfy/Ordered choice
700xf?Zero-or-more
700xf*One-or-more
700xf+Optional
700fx&And-predicate
700fx!Not-predicate

Examples

Write PEG like **[DCG]** clauses in prolog, but use <--/2 instead of -->/2. The /, ?, * and + operators and the DCG operators (like {}, `,`, `|`) are allowed in the body of the PEG clause. (If you use the `|` operator it create choice points like DCG).

Example 1

Program

:- use_module(library(peg_syntax)).

gram <-- "#", ("a" / "b")*, c+, "#"? .
c <-- "c".

Note: The space between the ? and `.` characters is necessary!

Executions

?- phrase(gram, `#abbacc`, T).
T = [].

?- phrase(gram, `#abba`, T).
false.

?- phrase(gram, `#abba#`, T).
false.

?- phrase(gram, `#ccc#`, T).
T = [].

Note: Each execution should have no choice points.

Example 2

Using the star * and the plus + operators change the semantic of variables inside these operators. As bellow, the H var inside the star operator describes an element of a list, but outside of the star operator describe that list.

Program

:- use_module(library(peg_syntax)).

bs(H) <-- (a(H) / b(H))* .
a(a) <-- "a".
b(b) <-- "b".

Executions

?- phrase(bs(V), `bbabxy`, T).
V = [b, b, a, b],
T = [120, 121].

?- phrase(bs(V), ``, T).
V = T, T = [].

Example 3

For each variable in a * operator is creating a separate list. Each element of the list is default uninitialized.

Program

:- use_module(library(peg_syntax)).

pars(lists(A,B)) <-- (a(A)/ b(B))* .
a(a) <-- "a".
b(b) <-- "b".

Execution

?- phrase(pars(P), `abba`, T).
P = lists([a, _, _, a], [_, b, b, _]),
T = [].

Example 4

If you want to have a different aggregator, add it by {} as below.

Program

:- use_module(library(peg_syntax)).

pars(P) <-- ((a(A)/ b(B)), {P = pair(A, B)})* .
a(a) <-- "a".
b(b) <-- "b".

Execution

?- phrase(pars(P), `abba`, T).
P = [pair(a, _), pair(_, b), pair(_, b), pair(a, _)],
T = [].

Example 5

Variables in the option operator if not used are uninitialized.

Program

:- use_module(library(peg_syntax)).

bopt(B) <-- b(B)? .
b(b) <-- "b".

Execution

?- phrase(bopt(X), `b`, []).
X = b.

?- phrase(bopt(X), ``, []).
true.

Example 6

The PEG grammar is [greedy] so the below bad//0 clause will not parse anything.

Program

:- use_module(library(peg_syntax)).

bad <-- "b"*, "b".

good <-- "b", "b"* .

Execution

?- phrase(bad, `bb`, []).
false.

?- phrase(good, `bb`, []).
true.

Example 7

Expressions inside the & and ! operators never consumes any input.

Program

:- use_module(library(peg_syntax)).

diff_list(X) <-- (& (char(A), !char(A)), char(X))* .

char(A) <-- [C], {char_code(A, C)}.

Note: The space between the & and `(` characters is necessary!

Execution

?- phrase(diff_list(X), `ababa`, T).
X = [a, b, a, b, a],
T = [].

?- phrase(diff_list(X), `ababba`, T).
X = [a, b, a],
T = [98, 98, 97].

Installation

To install this package write the bellow term in the swipl REPL.

?- pack_install(peg_syntax).

[PEG]: https://en.wikipedia.org/wiki/Parsing_expression_grammar [term_expansion/2]: https://www.swi-prolog.org/pldoc/doc_for?object=term_expansion/2 [swi-prolog]: https://www.swi-prolog.org/ [DCG]: https://eu.swi-prolog.org/pldoc/man?section=DCG [greedy]: https://en.wikipedia.org/wiki/Greedy_algorithm

Contents of pack "peg_syntax"

Pack contains 5 files holding a total of 11.6K bytes.