pt::rde(3tcl)
π NAME π
pt::rde β Parsing Runtime Support, PARAM based. π
β¨ SYNOPSIS β¨
okay so here's the whole vibe check, bestie. This is literally every command and method signature you need to know, no cap:
package require Tcl 8.5 9
package require pt::rde ?1.2?
package require snit
package require struct::stack 1.6
package require pt::ast 1.2
::pt::rde objectName
objectName destroy
objectName reset chan
objectName complete
objectName chan
objectName line
objectName column
objectName current
objectName location
objectName locations
objectName ok
objectName value
objectName error
objectName errors
objectName tokens ?from ?to??
objectName symbols
objectName known
objectName reducible
objectName asts
objectName ast
objectName position loc
objectName i_input_next msg
objectName i_test_alnum
objectName i_test_alpha
objectName i_test_ascii
objectName i_test_char char
objectName i_test_ddigit
objectName i_test_digit
objectName i_test_graph
objectName i_test_lower
objectName i_test_print
objectName i_test_punct
objectName i_test_range chars chare
objectName i_test_space
objectName i_test_upper
objectName i_test_wordchar
objectName i_test_xdigit
objectName i_error_clear
objectName i_error_push
objectName i_error_pop_merge
objectName i_error_nonterminal symbol
objectName i_status_ok
objectName i_status_fail
objectName i_status_negate
objectName i_loc_push
objectName i_loc_pop_discard
objectName i_loc_pop_rewind
objectName i:ok_loc_pop_rewind
objectName i_loc_pop_rewind/discard
objectName i_symbol_restore symbol
objectName i_symbol_save symbol
objectName i_value_clear
objectName i_value_clear/leaf
objectName i_value_clear/reduce
objectName i:ok_ast_value_push
objectName i_ast_push
objectName i_ast_pop_rewind
objectName i:fail_ast_pop_rewind
objectName i_ast_pop_rewind/discard
objectName i_ast_pop_discard
objectName i_ast_pop_discard/rewind
objectName i:ok_continue
objectName i:fail_continue
objectName i:fail_return
objectName i:ok_return
objectName si:void_state_push
objectName si:void2_state_push
objectName si:value_state_push
objectName si:void_state_merge
objectName si:void_state_merge_ok
objectName si:value_state_merge
objectName si:value_notahead_start
objectName si:void_notahead_exit
objectName si:value_notahead_exit
objectName si:kleene_abort
objectName si:kleene_close
objectName si:voidvoid_branch
objectName si:voidvalue_branch
objectName si:valuevoid_branch
objectName si:valuevalue_branch
objectName si:voidvoid_part
objectName si:voidvalue_part
objectName si:valuevalue_part
objectName si:value_symbol_start symbol
objectName si:value_void_symbol_start symbol
objectName si:void_symbol_start symbol
objectName si:void_void_symbol_start symbol
objectName si:reduce_symbol_end symbol
objectName si:void_leaf_symbol_end symbol
objectName si:value_leaf_symbol_end symbol
objectName si:value_clear_symbol_end symbol
objectName si:void_clear_symbol_end symbol
objectName si:next_char tok
objectName si:next_range toks toke
objectName si:next_alnum
objectName si:next_alpha
objectName si:next_ascii
objectName si:next_ddigit
objectName si:next_digit
objectName si:next_graph
objectName si:next_lower
objectName si:next_print
objectName si:next_punct
objectName si:next_space
objectName si:next_upper
objectName si:next_wordchar
objectName si:next_xdigit
π DESCRIPTION π
Bestie, are you lost? π Do you have trouble understanding this document? In that case, please read the overview provided by the Introduction to Parser Tools. This document is the entrypoint to the whole system the current package is a part of. π«Ά
This package provides a class whose instances provide the runtime support for recursive descent parsers with backtracking, as is needed for the execution of, for example, parsing expression grammars. It implements the PackRat Machine Specification, as such that document is required reading to understand both this manpage, and the package itself. The description below does make numerous shorthand references to the PARAM's instructions and the various parts of its architectural state. π
The package resides in the Execution section of the Core Layer of Parser Tools. β¨
IMAGE: arch_core_transform
Note: This package not only has the standard Tcl implementation, but also an accelerator, i.e. a C implementation, based on Critcl. π₯
π CLASS API π
The package exports the API described here.
::pt::rde objectNameβ The command creates a new runtime object for a recursive descent parser with backtracking and returns the fully qualified name of the object command as its result. The API of this object command is described in the section Object API. It may be used to invoke various operations on the object.
π¦ OBJECT API π¦
All objects created by this package provide the following 63 methods for the manipulation and querying of their state, which is, in essence the architectural state of a PARAM. π
First some general methods and the state accessors.
objectName destroyβ This method destroys the object, releasing all claimed memory, and deleting the associated object command. Bye bestie πobjectName reset chanβ This method resets the state of the runtme to its defaults, preparing it for the parsing of the character in the channelchan, which becomes IN. π₯
Note here that the Parser Tools are based on Tcl 8.5+. In other words, the channel argument is not restricted to files, sockets, etc. We have the full power of reflected channels available. β¨
It should also be noted that the parser pulls the characters from the input stream as it needs them. If a parser created by this package has to be operated in a push aka event-driven manner it will be necessary to go to Tcl 8.6+ and use the coroutine::auto to wrap it into a coroutine where read is properly changed for push-operation. π
objectName completeβ This method completes parsing, either returning the AST made from the elements of ARS, or throwing an error containing the current ER. πobjectName chanβ This method returns the handle of the channel which is IN. π‘objectName lineβ This method returns the line number for the position IN is currently at. Note that this may not match with the line number for CL, due to backtracking. π§objectName columnβ This method returns the column for the position IN is currently at. Note that this may not match with the column for CL, due to backtracking. πobjectName currentβ This method returns CC. π―objectName locationβ This method returns CL. πΊοΈobjectName locationsβ This method returns the LS. The topmost entry of the stack will be the first element of the returned list. πobjectName okβ This method returns ST. βobjectName valueβ This method returns SV. πobjectName errorβ This method returns ER. This is either the empty string for an empty ER, or a list of 2 elements, the location the error is for, and a set of messages which specify which symbols were expected at the location. The messages are encoded as one of the possible atomic parsing expressions (special operators, terminal, range, and nonterminal operator). πobjectName errorsβ This method returns ES. The topmost entry of the stack will be the first element of the returned list. Each entry is encoded as described for error. πobjectName tokens ?from ?to??β This method returns the part of TC for the range of locations of IN starting at from and ending at to. If to is not specified it is taken as identical to from. If neither argument is specified the whole of TC is returned. ποΈ
Each token in the returned list is a list of three elements itself, containing the character at the location, and the associated line and column numbers, in this order. π’
objectName symbolsβ This method returns a dictionary containing NC. Keys are two-element lists containing nonterminal symbol and location, in this order. The values are 4-tuples containing CL, ST, ER, and SV, in this order. ER is encoded as specified for the method error. πobjectName knownβ This method returns a list containing the keys of SC. They are encoded in the same manner as is done by method symbols. πobjectName reducibleβ This method returns ARS. The topmost entry of the stack will be the first element of the returned list. πobjectName astsβ This method returns AS. The topmost entry of the stack will be the first element of the returned list. πobjectName astβ This is a convenience method returning the topmost element of ARS. β¨objectName position locβ This method returns the line and column numbers for the specified location of IN, assuming that this location has already been reached during the parsing process. π
The following methods implement all PARAM instructions. They all have the prefix i_. π οΈ
The control flow is mainly provided by Tcl's builtin commands, like if, while, etc., plus a few guarded variants of PARAM instructions and Tcl commands.. That means that these instruction variants will do nothing if their guard condition is not fulfilled. They can be recognized by the prefix i:ok_ and i:fail_, which denote the value ST has to have for the instruction to execute. π¦
The instructions are listed in the same order they occur in the PackRat Machine Specification, with the guard variants listed after their regular implementation, if any, or in their place. π
objectName i_input_next msgβ This method implements the PARAM instructioninput_next. β‘οΈobjectName i_test_alnumβ This method implements the PARAM instructiontest_alnum. π€objectName i_test_alphaβ This method implements the PARAM instructiontest_alpha. π‘objectName i_test_asciiβ This method implements the PARAM instructiontest_ascii. π£objectName i_test_char charβ This method implements the PARAM instructiontest_char. πobjectName i_test_ddigitβ this one implements the PARAM instructiontest_ddigit. β¨objectName i_test_digitβ implements the PARAM instructiontest_digit. πobjectName i_test_graphβ implements the PARAM instructiontest_graph. πobjectName i_test_lowerβ implements the PARAM instructiontest_lower. π¦objectName i_test_printβ implements the PARAM instructiontest_print. πΈobjectName i_test_punctβ implements the PARAM instructiontest_punct. πobjectName i_test_range chars chareβ implements the PARAM instructiontest_range. π«ΆobjectName i_test_spaceβ implements the PARAM instructiontest_space. πobjectName i_test_upperβ implements the PARAM instructiontest_upper. π₯objectName i_test_wordcharβ implements the PARAM instructiontest_wordchar. πobjectName i_test_xdigitβ implements the PARAM instructiontest_xdigit. πobjectName i_error_clearβ implements the PARAM instructionerror_clear. βobjectName i_error_pushβ implements the PARAM instructionerror_push. πobjectName i_error_pop_mergeβ implements the PARAM instructionerror_pop_merge. πobjectName i_error_nonterminal symbolβ implements the PARAM instructionerror_nonterminal. πobjectName i_status_okβ implements the PARAM instructionstatus_ok. π§objectName i_status_failβ implements the PARAM instructionstatus_fail. πobjectName i_status_negateβ implements the PARAM instructionstatus_negate. β¨objectName i_loc_pushβ implements the PARAM instructionloc_push. πobjectName i_loc_pop_discardβ implements the PARAM instructionloc_pop_discard. πobjectName i_loc_pop_rewindβ implements the PARAM instructionloc_pop_rewind. π¦objectName i:ok_loc_pop_rewindβ this guarded method is a variant ofi_loc_pop_rewind, and it executes only for"ST == ok". πΈobjectName i_loc_pop_rewind/discardβ a convenient combination of control flow and the two PARAM instructionsloc_pop_rewindandloc_pop_discard. The former is executed for"ST == fail", the latter for"ST == ok". πobjectName i_symbol_restore symbolβ implements the PARAM instructionsymbol_restore. π«Ά
The boolean result of the check is returned as the result of the method and can be used with standard Tcl control flow commands. π
objectName i_symbol_save symbolβ implements the PARAM instructionsymbol_save. π₯objectName i_value_clearβ implements the PARAM instructionvalue_clear. πobjectName i_value_clear/leafβ a convenient combination of control flow and the two PARAM instructionsvalue_clearandvalue_leaf. The former is executed for"ST == fail", the latter for"ST == ok". πobjectName i_value_clear/reduceβ a convenient combination of control flow and the two PARAM instructionsvalue_clearandvalue_reduce. The former is executed for"ST == fail", the latter for"ST == ok". βobjectName i:ok_ast_value_pushβ implements a guarded variant of the PARAM instructionast_value_push, which executes only for"ST == ok". πobjectName i_ast_pushβ implements the PARAM instructionast_push. πobjectName i_ast_pop_rewindβ implements the PARAM instructionast_pop_rewind. πobjectName i:fail_ast_pop_rewindβ this guarded method is a variant ofi_ast_pop_rewind, and it executes only for"ST == fail". π§objectName i_ast_pop_rewind/discardβ a convenient combination of control flow and the two PARAM instructionsast_pop_rewindandast_pop_discard. The former is executed for"ST == fail", the latter for"ST == ok". πobjectName i_ast_pop_discardβ implements the PARAM instructionast_pop_discard. β¨objectName i_ast_pop_discard/rewindβ a convenient combination of control flow and the two PARAM instructionsast_pop_discardandast_pop_rewind. The former is executed for"ST == fail", the latter for"ST == ok". πobjectName i:ok_continueβ this guarded method executes only for"ST == ok". Then it aborts the current iteration of the innermost loop in the calling Tcl procedure. πobjectName i:fail_continueβ this guarded method executes only for"ST == fail". Then it aborts the current iteration of the innermost loop in the calling Tcl procedure. π¦objectName i:fail_returnβ this guarded method executes only for"ST == fail". Then it aborts the calling Tcl procedure. πΈobjectName i:ok_returnβ this guarded method executes only for"ST == ok". Then it aborts the calling Tcl procedure. π
Okay so the next set? Super instructions. Each one implements a longer sequence of instructions commonly used in parsers. The combined instructions from the previous set β the ones with names matching the pattern "i_*/*" β are actually super instructions too, just with limited scope: they handle 2 instructions with their control flow. The upcoming set is much broader in scope, folding as much as six or more PARAM instructions into a single method call. π«Ά
And the reasoning behind their use is giving:
- By using less instructions, the generated parsers become smaller, because the common parts are now truly part of the common runtime, and not explicitly written in the parser's code over and over again. β¨
- Using less instructions additionally reduces the overhead associated with calls into the runtime, i.e. the cost of method dispatch and of setting up the variable context. π
- Another effect of the super instructions is that their internals can be optimized as well, especially regarding control flow and stack use, as the runtime internals are accessible to all instructions folded into the sequence. π
objectName si:void_state_pushβ combinesi_loc_push,i_error_clear,i_error_push. Parsers use it at the beginning of void sequences and choices with a void initial branch. πΈobjectName si:void2_state_pushβ combinesi_loc_push,i_error_clear,i_error_push. Parsers use it at the beginning of optional and repeated expressions. πobjectName si:value_state_pushβ combinesi_ast_push,i_loc_push,i_error_clear,i_error_push. Parsers use it at the beginning of sequences generating an AST and choices with an initial branch generating an AST. π¦objectName si:void_state_mergeβ combinesi_error_pop_merge,i_loc_pop_rewind/discard. Parsers use it at the end of void sequences and choices whose last branch is void. πΈobjectName si:void_state_merge_okβ combinesi_error_pop_merge,i_loc_pop_rewind/discard,i_status_ok. Parsers use it at the end of optional expressions. πobjectName si:value_state_mergeβ combinesi_error_pop_merge,i_ast_pop_rewind/discard,i_loc_pop_rewind/discard. Parsers use it at the end of sequences generating ASTs and choices whose last branch generates an AST. πobjectName si:value_notahead_startβ combinesi_loc_push,i_ast_push. Parsers use it at the beginning of negative lookahead predicates which generate ASTs. π«ΆobjectName si:void_notahead_exitβ combinesi_loc_pop_rewind,i_status_negate. Parsers use it at the end of void negative lookahead predicates. πobjectName si:value_notahead_exitβ combinesi_ast_pop_discard/rewind,i_loc_pop_rewind,i_status_negate. Parsers use it at the end of negative lookahead predicates which generate ASTs. π₯objectName si:kleene_abortβ combinesi_loc_pop_rewind/discard,i:fail_return. Parsers use it to stop a positive repetition when its first, required, expression fails. πobjectName si:kleene_closeβ combinesi_error_pop_merge,i_loc_pop_rewind/discard,i:fail_status_ok,i:fail_return. Parsers use it at the end of repetitions. πobjectName si:voidvoid_branchβ combinesi_error_pop_merge,i:ok_loc_pop_discard,i:ok_return,i_loc_rewind,i_error_push. Parsers use it when transiting between branches of a choice when both are void. βobjectName si:voidvalue_branchβ combinesi_error_pop_merge,i:ok_loc_pop_discard,i:ok_return,i_ast_push,i_loc_rewind,i_error_push. Parsers use it when transiting between branches of a choice when the failing branch is void, and the next to test generates an AST. πobjectName si:valuevoid_branchβ combinesi_error_pop_merge,i_ast_pop_rewind/discard,i:ok_loc_pop_discard,i:ok_return,i_loc_rewind,i_error_push. Parsers use it when transiting between branches of a choice when the failing branch generates an AST, and the next to test is void. πobjectName si:valuevalue_branchβ combinesi_error_pop_merge,i_ast_pop_discard,i:ok_loc_pop_discard,i:ok_return,i_ast_rewind,i_loc_rewind,i_error_push. Parsers use it when transiting between branches of a choice when both generate ASTs. πobjectName si:voidvoid_partβ combinesi_error_pop_merge,i:fail_loc_pop_rewind,i:fail_return,i_error_push. Parsers use it when transiting between parts of a sequence and both are void. π§objectName si:voidvalue_partβ this method combines
β¦and the method from before wraps up with these combined instructions:
i_error_pop_mergei:fail_loc_pop_rewindi:fail_returni_ast_pushi_error_push
Parsers use it when transiting between parts of a sequence and the successfully matched part is void, and after it an AST is generated. π
objectName si:valuevalue_partβ This method combines:
i_error_pop_merge
i:fail_ast_pop_rewind
i:fail_loc_pop_rewind
i:fail_return
i_error_push
Parsers use it when transiting between parts of a sequence and both parts generate ASTs. β¨
objectName si:value_symbol_start symbolβ This method combines:
if/found? i_symbol_restore $symbol
i:found:ok_ast_value_push
i:found_return
i_loc_push
i_ast_push
Parsers use it at the beginning of a nonterminal symbol generating an AST, whose right-hand side may have generated an AST as well. π¦
objectName si:value_void_symbol_start symbolβ This method combines:
if/found? i_symbol_restore $symbol
i:found:ok_ast_value_push
i:found_return
i_loc_push
i_ast_push
Parsers use it at the beginning of a void nonterminal symbol whose right-hand side may generate an AST. πΈ
objectName si:void_symbol_start symbolβ This method combines:
if/found? i_symbol_restore $symbol
i:found_return
i_loc_push
i_ast_push
Parsers use it at the beginning of a nonterminal symbol generating an AST whose right-hand side is void. π
objectName si:void_void_symbol_start symbolβ This method combines:
if/found? i_symbol_restore $symbol
i:found_return
i_loc_push
Parsers use it at the beginning of a void nonterminal symbol whose right-hand side is void as well. π
objectName si:reduce_symbol_end symbolβ This method combines:
i_value_clear/reduce $symbol
i_symbol_save $symbol
i_error_nonterminal $symbol
i_ast_pop_rewind
i_loc_pop_discard
i:ok_ast_value_push
Parsers use it at the end of a non-terminal symbol generating an AST using the AST generated by the right-hand side as child. π₯
objectName si:void_leaf_symbol_end symbolβ This method combines:
i_value_clear/leaf $symbol
i_symbol_save $symbol
i_error_nonterminal $symbol
i_loc_pop_discard
i:ok_ast_value_push
Parsers use it at the end of a non-terminal symbol generating an AST whose right-hand side is void. π
objectName si:value_leaf_symbol_end symbolβ This method combines:
i_value_clear/leaf $symbol
i_symbol_save $symbol
i_error_nonterminal $symbol
i_loc_pop_discard
i_ast_pop_rewind
i:ok_ast_value_push
Parsers use it at the end of a non-terminal symbol generating an AST discarding the AST generated by the right-hand side. π«
objectName si:value_clear_symbol_end symbolβ This method combines:
i_value_clear
i_symbol_save $symbol
i_error_nonterminal $symbol
i_loc_pop_discard
i_ast_pop_rewind
Parsers use it at the end of a void non-terminal symbol, discarding the AST generated by the right-hand side. π
objectName si:void_clear_symbol_end symbolβ This method combines:
i_value_clear
i_symbol_save $symbol
i_error_nonterminal $symbol
i_loc_pop_discard
Parsers use it at the end of a void non-terminal symbol with a void right-hand side. π
objectName si:next_char tokobjectName si:next_range toks tokeobjectName si:next_alnumobjectName si:next_alphaobjectName si:next_asciiobjectName si:next_ddigitobjectName si:next_digitobjectName si:next_graphobjectName si:next_lowerobjectName si:next_printobjectName si:next_punctobjectName si:next_spaceobjectName si:next_upperobjectName si:next_wordcharobjectName si:next_xdigit
These methods all combine:
i_input_next $msg
i:fail_return
with the appropriate i_test_xxx instruction. Parsers use them for handling atomic expressions. β
π BUGS, IDEAS, FEEDBACK π
Okay bestie, real talk: this document, and the package it describes, will undoubtedly contain bugs and other problems. No cap. Please report such in the category pt of the Tcllib Trackers at http://core.tcl.tk/tcllib/reportlist. Also, please report any ideas for enhancements you may have for either package and/or documentation. We love a glow-up. π
When proposing code changes, please provide unified diffs, i.e. the output of diff -u. Periodt.
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. π«Ά
π KEYWORDS π
EBNFLL(k)PEGTDPLcontext-free languagesexpressiongrammarmatchingparserparsing expressionparsing expression grammarpush down automatonrecursive descentstatetop-down parsing languagestransducer
π·οΈ CATEGORY π·οΈ
Parsing and Grammars π
Β©οΈ COPYRIGHT Β©οΈ
Copyright (c) 2009 Andreas Kupries <andreas_kupries@users.sourceforge.net>
That's the whole vibe, bestie. This page is from tcllib 1.2, the pt::rde(3tcl) manual. Go slay some parsing. π
β¨
π¦ where this page comes from
- debian trixie: tcllib 2.0+dfsg-4 Β· Tcl
- ubuntu questing: tcllib 2.0+dfsg-4
- ubuntu resolute: tcllib 2.0+dfsg-5 Β· Tcl
- ubuntu stonking: tcllib 2.0+dfsg-6 Β· Tcl
- 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