pt::peg::export(n)
β¨ pt::peg::export β PEG Export β¨
okay bestie, welcome to pt::peg::export(n) from the Parser Tools manual π this is part one of three so grab a strawberry drink, we're going in π
πΈ SYNOPSIS πΈ
package require Tcl 8.5 9
package require snit
package require struct::map
package require pt::peg
package require pluginmgr
package require pt::peg::export ?1.0.2?
::pt::peg::export objectName
objectName method ?arg arg ...?
objectName destroy
objectName export serial serial ?format?
objectName export object object ?format?
objectName configuration names
objectName configuration get
objectName configuration set name ?value?
objectName configuration unset pattern...
π¦ DESCRIPTION π¦
Are you lost ? Do you have trouble understanding this document ? no bc same sometimes π if that's you, please read the overview provided by the Introduction to Parser Tools. That document is the entrypoint to the whole system this current package is a part of β like, the front door of the whole house π
So here's the vibe: this package is a manager for parsing expression grammars, and each instance handles a whole set of plugins for exporting them to other formats. Translation: converting your grammar into stuff like nroff, HTML, etc. β¨
It lives in the Export section of the Core Layer of Parser Tools, and it's one of the three pillars that the management of parsing expression grammars rests on π
IMAGE: arch_core_export
The other two pillars are, as shown above:
- PEG Import, and
- PEG Storage
For information about the data structure which is the major input to the manager objects provided by this package, see the section PEG serialization format.
The plugin system of this class is based on the package pluginmgr, and it's configured to look for plugins using:
- the environment variable
GRAMMAR_PEG_EXPORT_PLUGINS, - the environment variable
GRAMMAR_PEG_PLUGINS, - the environment variable
GRAMMAR_PLUGINS, - the path
"~/.grammar/peg/export/plugin" - the path
"~/.grammar/peg/plugin" - the path
"~/.grammar/plugin" - the path
"~/.grammar/peg/export/plugins" - the path
"~/.grammar/peg/plugins" - the path
"~/.grammar/plugins" - the registry entry
"HKEY_CURRENT_USER\SOFTWARE\GRAMMAR\PEG\EXPORT\PLUGINS" - the registry entry
"HKEY_CURRENT_USER\SOFTWARE\GRAMMAR\PEG\PLUGINS" - the registry entry
"HKEY_CURRENT_USER\SOFTWARE\GRAMMAR\PLUGINS"
heads up bestie: those last three? only used when the package is run on a machine using the Windows(tm) operating system πͺ
The whole system is delivered with three predefined export plugins, namely:
containerβ see PEG Export Plugin. To CONTAINER format for details.jsonβ see PEG Export Plugin. To JSON format for details.pegβ see PEG Export Plugin. To PEG format for details.
And for the readers wishing to write their own export plugin for some format (hi plugin writers π), reading and understanding the Parser Tools Export API specification is an absolute necessity β it documents the interaction between this package and its plugins in detail, fr fr.
π API π
π PACKAGE COMMANDS π
::pt::peg::export objectNameβ this command creates a brand new export manager object with an associated Tcl command whose name is objectName. That object command is explained in full detail in the sections Object command and Object methods. The object command gets created under the current namespace if objectName isn't fully qualified, and in the specified namespace otherwise β¨
π OBJECT COMMAND π
All objects created by the ::pt::peg::export command have the following general form:
objectName method ?arg arg ...?
objectName method ?arg arg ...?β the method method and its arg'uments determine the exact behavior of the command. See section Object methods for the detailed specifications π
π OBJECT METHODS π
objectName destroyβ this method destroys the object it is invoked for π bye bestieobjectName export serial serial ?format?β this method takes the canonical serialization of a parsing expression grammar stored in serial and converts it to the specified format, using the export plugin for that format. It will fail with an error if no plugin could be found for the format π The string generated by the conversion process is returned as the result of this method.
If no format is specified the method defaults to text.
The specification of what a canonical serialization is can be found in the section PEG serialization format.
The plugin has to conform to the interface documented in the Parser Tools Export API specification.
objectName export object object ?format?β this method is a convenient lil wrapper around theexport serialmethod described by the previous item π«Ά It expects that object is an object command supporting aserializemethod returning the canonical serialization of a parsing expression grammar. It invokes that method, feeds the result intoexport serial, and returns the resulting string as its own result. chef's kiss, no cap π©βπ³objectName configuration namesβ this method returns a list containing the names of all configuration options currently known to the object πobjectName configuration getβ this method returns a dictionary containing the names and values of all configuration options currently known to the object ποΈobjectName configuration set name ?value?β this method sets the configuration option name to the specified value and returns the new value of the option.
If no value is specified it simply returns the current value, without changing it π
important: note that these configuration options and their values are simply passed to a plugin when the actual export is performed. It is the plugin which checks the validity, not the manager β οΈ so don't come for the manager, she's just the messenger π
objectName configuration unset pattern...β this method unsets all configuration options matching the specified glob patterns. If no pattern is specified it will unset all currently defined configuration options π§Ήβ¨
πΈ PEG SERIALIZATION FORMAT πΈ
okay bestie so this is the part where we talk about the format β like, the actual way the Parser Tools serialise Parsing Expression Grammars into immutable values, so they can be shipped around, compared, whatever. fr fr this is the tea. β
We gotta distinguish between regular and canonical serializations. And the way it works is: a PEG can have more than one regular serialization, but literally exactly one of them is canonical. One. periodt. π
β¨ regular serialization β¨
- The serialization of any PEG is a nested Tcl dictionary. πͺ
- This dictionary holds a single key,
pt::grammar::peg, and its value. This value holds the contents of the grammar. - The contents of the grammar are a Tcl dictionary holding the set of nonterminal symbols and the starting expression. The relevant keys and their values are:
rulesβ the value is a Tcl dictionary whose keys are the names of the nonterminal symbols known to the grammar. π- Each nonterminal symbol may occur only once. no duplicates, bestie.
- The empty string is not a legal nonterminal symbol. (
""? not a vibe. rejected. π) - The value for each symbol is a Tcl dictionary itself. The relevant keys and their values in this dictionary are:
isβ the value is the serialization of the parsing expression describing the symbol's sentennial structure, as specified in the section PE serialization format.modeβ the value can be one of three values specifying how a parser should handle the semantic value produced by the symbol.valueβ the semantic value of the nonterminal symbol is an abstract syntax tree consisting of a single node node for the nonterminal itself, which has the ASTs of the symbol's right hand side as its children.leafβ the semantic value of the nonterminal symbol is an abstract syntax tree consisting of a single node node for the nonterminal, without any children. Any ASTs generated by the symbol's right hand side are discarded. πvoidβ the nonterminal has no semantic value. Any ASTs generated by the symbol's right hand side are discarded (as well). π³οΈ
startβ the value is the serialization of the start parsing expression of the grammar, as specified in the section PE serialization format.
- The terminal symbols of the grammar are specified implicitly as the set of all terminal symbols used in the start expression and on the RHS of the grammar rules. like, they're justβ¦ there. manifesting. β¨
π¦ canonical serialization π¦
The canonical serialization of a grammar has the format as specified in the previous item, and then additionally satisfies the constraints below, which make it unique among all the possible serializations of this grammar. this is the one true form bestie, no cap.
- The keys found in all the nested Tcl dictionaries are sorted in ascending dictionary order, as generated by Tcl's builtin command
lsort -increasing -dict. - The string representation of the value is the canonical representation of a Tcl dictionary. I.e. it does not contain superfluous whitespace. zero crumbs. clean. π§Ό
π EXAMPLE π
Assuming the following PEG for simple mathematical expressions:
PEG calculator (Expression)
Digit <- '0'/'1'/'2'/'3'/'4'/'5'/'6'/'7'/'8'/'9' ;
Sign <- '-' / '+' ;
Number <- Sign? Digit+ ;
Expression <- Term (AddOp Term)* ;
MulOp <- '*' / '/' ;
Term <- Factor (MulOp Factor)* ;
AddOp <- '+'/'-' ;
Factor <- '(' Expression ')' / Number ;
END;
then its canonical serialization (except for whitespace) is:
pt::grammar::peg {
rules {
AddOp {is {/ {t -} {t +}} mode value}
Digit {is {/ {t 0} {t 1} {t 2} {t 3} {t 4} {t 5} {t 6} {t 7} {t 8} {t 9}} mode value}
Expression {is {x {n Term} {* {x {n AddOp} {n Term}}}} mode value}
Factor {is {/ {x {t (} {n Expression} {t )}} {n Number}} mode value}
MulOp {is {/ {t *} {t /}} mode value}
Number {is {x {? {n Sign}} {+ {n Digit}}} mode value}
Sign {is {/ {t -} {t +}} mode value}
Term {is {x {n Factor} {* {x {n MulOp} {n Factor}}}} mode value}
}
start {n Expression}
}
look at that gorgeous sorted-by-lsort -increasing -dict glow-up. π
every rule lined up, mode value on everything, start {n Expression} chillin' at the bottom. iconic. π₯
β¨ PE SERIALIZATION FORMAT β¨
Okay bestie, this is the part where we spill the tea on the exact format Parser Tools uses to serialize Parsing Expressions into immutable values β for transport, for comparison, all that good stuff. Think of it as the PE glow-up that lets it travel without losing its identity. π
And listen, there are two flavors here: regular and canonical serialization. A parsing expression can have more than one regular serialization (she contains multitudes π), but exactly one of them is canonical. Only one main character. π
πΈ Regular serialization
π Atomic Parsing Expressions
- The string
epsilonis an atomic parsing expression. It matches the empty string. (Yes, she matches nothing. Iconic behavior honestly.) - The string
dotis an atomic parsing expression. It matches any character. - The string
alnumis an atomic parsing expression. It matches any Unicode alphabet or digit character. This is a custom extension of PEs based on Tcl's builtin commandstring is. - The string
alphais an atomic parsing expression. It matches any Unicode alphabet character. This is a custom extension of PEs based on Tcl's builtin commandstring is. - The string
asciiis an atomic parsing expression. It matches any Unicode character below U0080. This is a custom extension of PEs based on Tcl's builtin commandstring is. - The string
controlis an atomic parsing expression. It matches any Unicode control character. This is a custom extension of PEs based on Tcl's builtin commandstring is. - The string
digitis an atomic parsing expression. It matches any Unicode digit character. Note that this includes characters outside of the[0..9]range. This is a custom extension of PEs based on Tcl's builtin commandstring is. - The string
graphis an atomic parsing expression. It matches any Unicode printing character, except for space. This is a custom extension of PEs based on Tcl's builtin commandstring is. - The string
loweris an atomic parsing expression. It matches any Unicode lower-case alphabet character. This is a custom extension of PEs based on Tcl's builtin commandstring is. - The string
printis an atomic parsing expression. It matches any Unicode printing character, including space. This is a custom extension of PEs based on Tcl's builtin commandstring is. - The string
punctis an atomic parsing expression. It matches any Unicode punctuation character. This is a custom extension of PEs based on Tcl's builtin commandstring is. - The string
spaceis an atomic parsing expression. It matches any Unicode space character. This is a custom extension of PEs based on Tcl's builtin commandstring is. - The string
upperis an atomic parsing expression. It matches any Unicode upper-case alphabet character. This is a custom extension of PEs based on Tcl's builtin commandstring is. - The string
wordcharis an atomic parsing expression. It matches any Unicode word character. This is any alphanumeric character (seealnum), and any connector punctuation characters (e.g. underscore). This is a custom extension of PEs based on Tcl's builtin commandstring is. - The string
xdigitis an atomic parsing expression. It matches any hexadecimal digit character. This is a custom extension of PEs based on Tcl's builtin commandstring is. - The string
ddigitis an atomic parsing expression. It matches any decimal digit character. This is a custom extension of PEs based on Tcl's builtin commandregexp. - The expression
[list t x]is an atomic parsing expression. It matches the terminal string x. - The expression
[list n A]is an atomic parsing expression. It matches the nonterminal A.
π¦ Combined Parsing Expressions
- For parsing expressions e1, e2, ... the result of
[list / e1 e2 ... ]is a parsing expression as well. This is the ordered choice, aka prioritized choice. - For parsing expressions e1, e2, ... the result of
[list x e1 e2 ... ]is a parsing expression as well. This is the sequence. - For a parsing expression e the result of
[list * e]is a parsing expression as well. This is the kleene closure, describing zero or more repetitions. - For a parsing expression e the result of
[list + e]is a parsing expression as well. This is the positive kleene closure, describing one or more repetitions. - For a parsing expression e the result of
[list & e]is a parsing expression as well. This is the and lookahead predicate. - For a parsing expression e the result of
[list ! e]is a parsing expression as well. This is the not lookahead predicate. - For a parsing expression e the result of
[list ? e]is a parsing expression as well. This is the optional input.
π Canonical serialization
The canonical serialization of a parsing expression has the format as specified in the previous item, and then additionally satisfies the constraints below, which make it unique among all the possible serializations of this parsing expression. No dupes, no chaos, just one true form. β¨
- The string representation of the value is the canonical representation of a pure Tcl list. I.e. it does not contain superfluous whitespace. (Clean girl aesthetic, fr fr. π§)
- Terminals are not encoded as ranges (where start and end of the range are identical).
π EXAMPLE
Say the parsing expression is the thing on the right-hand side of the rule
Expression <- Term (AddOp Term)*
then its canonical serialization (except for whitespace) is
{x {n Term} {* {x {n AddOp} {n Term}}}}
Not me staring at that and going "okay but she ate". ππ₯
π«Ά BUGS, IDEAS, FEEDBACK
This document, and the package it describes, will undoubtedly contain bugs and other problems. (Bestie, it's a manpage. It's giving humble.) Please report such in the category pt of the Tcllib Trackers [http://core.tcl.tk/tcllib/reportlist]. Please also report any ideas for enhancements you may have for either package and/or documentation.
When proposing code changes, please provide unified diffs, i.e the output of diff -u. That's the vibe check for patch submissions. π
Note further that attachments are strongly preferred over inlined patches. Attachments can be made by going to the Edit form of the ticket immediately after its creation, and then using the left-most button in the secondary navigation bar. Go off, keyboard warrior. β¨οΈβ¨
β KEYWORDS
- EBNF
- LL(k)
- PEG
- TDPL
- context-free languages
- expression
- grammar
- matching
- parser
- parsing expression
- parsing expression grammar
- push down automaton
- recursive descent
- state
- top-down parsing languages
- transducer
π CATEGORY
Parsing and Grammars
π COPYRIGHT
Copyright (c) 2009 Andreas Kupries <andreas_kupries@users.sourceforge.net>
And that's a wrap, babe! This whole thing is from tcllib, version 1.0.2, dated for pt::peg::export(n) β you're officially caught up, go forth and serialize responsibly. ππ¦π
π¦ where this page comes from
- fedora 43: tcllib 2.0-3.fc43 Β· TCL
- fedora 44: tcllib 2.0-4.fc44 Β· TCL
- nixos 26.05: tcllib 2.0
- nixpkgs unstable: tcllib 2.0
- Copyright (c) 2009 Andreas Kupries <andreas_kupries@users\&.sourceforge\&.net>
- π girlified by deepseek-ai/DeepSeek-V4.1-Flash on : a language model's rewrite of the original, under its terms