636 lines
31 KiB
Factor
Executable File
636 lines
31 KiB
Factor
Executable File
USING: generic help.syntax help.markup kernel math parser words
|
|
effects classes generic.standard tuples generic.math arrays
|
|
io.files vocabs.loader io sequences assocs ;
|
|
IN: syntax
|
|
|
|
ARTICLE: "parser-algorithm" "Parser algorithm"
|
|
"At the most abstract level, Factor syntax consists of whitespace-separated tokens. The parser tokenizes the input on whitespace boundaries. The parser is case-sensitive and whitespace between tokens is significant, so the following three expressions tokenize differently:"
|
|
{ $code "2X+\n2 X +\n2 x +" }
|
|
"As the parser reads tokens it makes a distinction between numbers, ordinary words, and parsing words. Tokens are appended to the parse tree, the top level of which is a quotation returned by the original parser invocation. Nested levels of the parse tree are created by parsing words."
|
|
$nl
|
|
"The parser iterates through the input text, checking each character in turn. Here is the parser algorithm in more detail -- some of the concepts therein will be defined shortly:"
|
|
{ $list
|
|
{ "If the current character is a double-quote (\"), the " { $link POSTPONE: " } " parsing word is executed, causing a string to be read." }
|
|
{
|
|
"Otherwise, the next token is taken from the input. The parser searches for a word named by the token in the currently used set of vocabularies. If the word is found, one of the following two actions is taken:"
|
|
{ $list
|
|
"If the word is an ordinary word, it is appended to the parse tree."
|
|
"If the word is a parsing word, it is executed."
|
|
}
|
|
}
|
|
"Otherwise if the token does not represent a known word, the parser attempts to parse it as a number. If the token is a number, the number object is added to the parse tree. Otherwise, an error is raised and parsing halts."
|
|
}
|
|
"Parsing words play a key role in parsing; while ordinary words and numbers are simply added to the parse tree, parsing words execute in the context of the parser, and can do their own parsing and create nested data structures in the parse tree. Parsing words are also able to define new words."
|
|
$nl
|
|
"While parsing words supporting arbitrary syntax can be defined, the default set is found in the " { $vocab-link "syntax" } " vocabulary and provides the basis for all further syntactic interaction with Factor." ;
|
|
|
|
ARTICLE: "syntax-comments" "Comments"
|
|
{ $subsection POSTPONE: ! }
|
|
{ $subsection POSTPONE: #! } ;
|
|
|
|
ARTICLE: "syntax-immediate" "Parse time evaluation"
|
|
"Code can be evaluated at parse time. This is a rarely-used feature; one use-case is " { $link "loading-libs" } ", where you want to execute some code before the words in a source file are compiled."
|
|
{ $subsection POSTPONE: << }
|
|
{ $subsection POSTPONE: >> } ;
|
|
|
|
ARTICLE: "syntax-integers" "Integer syntax"
|
|
"The printed representation of an integer consists of a sequence of digits, optionally prefixed by a sign."
|
|
{ $code
|
|
"123456"
|
|
"-10"
|
|
"2432902008176640000"
|
|
}
|
|
"Integers are entered in base 10 unless prefixed with a base change parsing word."
|
|
{ $subsection POSTPONE: BIN: }
|
|
{ $subsection POSTPONE: OCT: }
|
|
{ $subsection POSTPONE: HEX: }
|
|
"More information on integers can be found in " { $link "integers" } "." ;
|
|
|
|
ARTICLE: "syntax-ratios" "Ratio syntax"
|
|
"The printed representation of a ratio is a pair of integers separated by a slash (/), prefixed by an optional whole number part followed by a plus (+). No intermediate whitespace is permitted. Here are some examples:"
|
|
{ $code
|
|
"75/33"
|
|
"1/10"
|
|
"-5/-6"
|
|
"1+1/3"
|
|
"-10+1/7"
|
|
}
|
|
"More information on ratios can be found in " { $link "rationals" } ;
|
|
|
|
ARTICLE: "syntax-floats" "Float syntax"
|
|
"Floating point literals must contain a decimal point, and may contain an exponent:"
|
|
{ $code
|
|
"10.5"
|
|
"-3.1456"
|
|
"7.e13"
|
|
"1.0e-5"
|
|
}
|
|
"More information on floats can be found in " { $link "floats" } "." ;
|
|
|
|
ARTICLE: "syntax-complex-numbers" "Complex number syntax"
|
|
"A complex number is given by two components, a ``real'' part and ''imaginary'' part. The components must either be integers, ratios or floats."
|
|
{ $code
|
|
"C{ 1/2 1/3 } ! the complex number 1/2+1/3i"
|
|
"C{ 0 1 } ! the imaginary unit"
|
|
}
|
|
{ $subsection POSTPONE: C{ }
|
|
"More information on complex numbers can be found in " { $link "complex-numbers" } "." ;
|
|
|
|
ARTICLE: "syntax-numbers" "Number syntax"
|
|
"If a vocabulary lookup of a token fails, the parser attempts to parse it as a number."
|
|
{ $subsection "syntax-integers" }
|
|
{ $subsection "syntax-ratios" }
|
|
{ $subsection "syntax-floats" }
|
|
{ $subsection "syntax-complex-numbers" } ;
|
|
|
|
ARTICLE: "syntax-words" "Word syntax"
|
|
"A word occurring inside a quotation is executed when the quotation is called. Sometimes a word needs to be pushed on the data stack instead. The canonical use-case for this is passing the word to the " { $link execute } " combinator, or alternatively, reflectively accessing word properties (" { $link "word-props" } ")."
|
|
{ $subsection POSTPONE: \ }
|
|
{ $subsection POSTPONE: POSTPONE: }
|
|
"The implementation of the " { $link POSTPONE: \ } " word is discussed in detail in " { $link "reading-ahead" } ". Words are documented in " { $link "words" } "." ;
|
|
|
|
ARTICLE: "escape" "Character escape codes"
|
|
{ $table
|
|
{ "Escape code" "Meaning" }
|
|
{ { $snippet "\\\\" } { $snippet "\\" } }
|
|
{ { $snippet "\\s" } "a space" }
|
|
{ { $snippet "\\t" } "a tab" }
|
|
{ { $snippet "\\n" } "a newline" }
|
|
{ { $snippet "\\r" } "a carriage return" }
|
|
{ { $snippet "\\0" } "a null byte (ASCII 0)" }
|
|
{ { $snippet "\\e" } "escape (ASCII 27)" }
|
|
{ { $snippet "\\\"" } { $snippet "\"" } }
|
|
{ { $snippet "\\u" { $emphasis "xxxxxx" } } { "The Unicode code point with hexadecimal number " { $snippet { $emphasis "xxxxxx" } } } }
|
|
{ { $snippet "\\u{" { $emphasis "name" } "}" } { "The Unicode code point named " { $snippet { $emphasis "name" } } } }
|
|
} ;
|
|
|
|
ARTICLE: "syntax-strings" "Character and string syntax"
|
|
"Factor has no distinct character type, however Unicode character value integers can be read by specifying a literal character, or an escaped representation thereof."
|
|
{ $subsection POSTPONE: CHAR: }
|
|
{ $subsection POSTPONE: " }
|
|
{ $subsection "escape" }
|
|
"Strings are documented in " { $link "strings" } "." ;
|
|
|
|
ARTICLE: "syntax-sbufs" "String buffer syntax"
|
|
{ $subsection POSTPONE: SBUF" }
|
|
"String buffers are documented in " { $link "sbufs" } "." ;
|
|
|
|
ARTICLE: "syntax-arrays" "Array syntax"
|
|
{ $subsection POSTPONE: { }
|
|
{ $subsection POSTPONE: } }
|
|
"Arrays are documented in " { $link "arrays" } "." ;
|
|
|
|
ARTICLE: "syntax-vectors" "Vector syntax"
|
|
{ $subsection POSTPONE: V{ }
|
|
"Vectors are documented in " { $link "vectors" } "." ;
|
|
|
|
ARTICLE: "syntax-hashtables" "Hashtable syntax"
|
|
{ $subsection POSTPONE: H{ }
|
|
"Hashtables are documented in " { $link "hashtables" } "." ;
|
|
|
|
ARTICLE: "syntax-tuples" "Tuple syntax"
|
|
{ $subsection POSTPONE: T{ }
|
|
"Tuples are documented in " { $link "tuples" } "." ;
|
|
|
|
ARTICLE: "syntax-quots" "Quotation syntax"
|
|
{ $subsection POSTPONE: [ }
|
|
{ $subsection POSTPONE: ] }
|
|
"Quotations are documented in " { $link "quotations" } "." ;
|
|
|
|
ARTICLE: "syntax-bit-arrays" "Bit array syntax"
|
|
{ $subsection POSTPONE: ?{ }
|
|
"Bit arrays are documented in " { $link "bit-arrays" } "." ;
|
|
|
|
ARTICLE: "syntax-float-arrays" "Float array syntax"
|
|
{ $subsection POSTPONE: F{ }
|
|
"Float arrays are documented in " { $link "float-arrays" } "." ;
|
|
|
|
ARTICLE: "syntax-byte-arrays" "Byte array syntax"
|
|
{ $subsection POSTPONE: B{ }
|
|
"Byte arrays are documented in " { $link "byte-arrays" } "." ;
|
|
|
|
ARTICLE: "syntax-bit-vectors" "Bit vector syntax"
|
|
{ $subsection POSTPONE: ?V{ }
|
|
"Bit vectors are documented in " { $link "bit-vectors" } "." ;
|
|
|
|
ARTICLE: "syntax-float-vectors" "Float vector syntax"
|
|
{ $subsection POSTPONE: FV{ }
|
|
"Float vectors are documented in " { $link "float-vectors" } "." ;
|
|
|
|
ARTICLE: "syntax-byte-vectors" "Byte vector syntax"
|
|
{ $subsection POSTPONE: BV{ }
|
|
"Byte vectors are documented in " { $link "byte-vectors" } "." ;
|
|
|
|
ARTICLE: "syntax-pathnames" "Pathname syntax"
|
|
{ $subsection POSTPONE: P" }
|
|
"Pathnames are documented in " { $link "pathnames" } "." ;
|
|
|
|
ARTICLE: "syntax-literals" "Literals"
|
|
"Many different types of objects can be constructed at parse time via literal syntax. Numbers are a special case since support for reading them is built-in to the parser. All other literals are constructed via parsing words."
|
|
$nl
|
|
"If a quotation contains a literal object, the same literal object instance is used each time the quotation executes; that is, literals are ``live''."
|
|
$nl
|
|
"Using mutable object literals in word definitions requires care, since if those objects are mutated, the actual word definition will be changed, which is in most cases not what you would expect. Literals should be " { $link clone } "d before being passed to word which may potentially mutate them."
|
|
{ $subsection "syntax-numbers" }
|
|
{ $subsection "syntax-words" }
|
|
{ $subsection "syntax-quots" }
|
|
{ $subsection "syntax-arrays" }
|
|
{ $subsection "syntax-strings" }
|
|
{ $subsection "syntax-bit-arrays" }
|
|
{ $subsection "syntax-byte-arrays" }
|
|
{ $subsection "syntax-float-arrays" }
|
|
{ $subsection "syntax-vectors" }
|
|
{ $subsection "syntax-sbufs" }
|
|
{ $subsection "syntax-bit-vectors" }
|
|
{ $subsection "syntax-byte-vectors" }
|
|
{ $subsection "syntax-float-vectors" }
|
|
{ $subsection "syntax-hashtables" }
|
|
{ $subsection "syntax-tuples" }
|
|
{ $subsection "syntax-pathnames" } ;
|
|
|
|
ARTICLE: "syntax" "Syntax"
|
|
"Factor has two main forms of syntax: " { $emphasis "definition" } " syntax and " { $emphasis "literal" } " syntax. Code is data, so the syntax for code is a special case of object literal syntax. This section documents literal syntax. Definition syntax is covered in " { $link "words" } ". Extending the parser is the main topic of " { $link "parser" } "."
|
|
{ $subsection "parser-algorithm" }
|
|
{ $subsection "syntax-comments" }
|
|
{ $subsection "syntax-literals" }
|
|
{ $subsection "syntax-immediate" } ;
|
|
|
|
ABOUT: "syntax"
|
|
|
|
HELP: delimiter
|
|
{ $syntax ": foo ... ; delimiter" }
|
|
{ $description "Declares the most recently defined word as a delimiter. Delimiters are words which are only ever valid as the end of a nested block to be read by " { $link parse-until } ". An unpaired occurrence of a delimiter is a parse error." } ;
|
|
|
|
HELP: parsing
|
|
{ $syntax ": foo ... ; parsing" }
|
|
{ $description "Declares the most recently defined word as a parsing word." }
|
|
{ $examples "In the below example, the " { $snippet "world" } " word is never called, however its body references a parsing word which executes immediately:" { $example "USE: io" "<< : hello \"Hello parser!\" print ; parsing >>\n: world hello ;" "Hello parser!" } } ;
|
|
|
|
HELP: inline
|
|
{ $syntax ": foo ... ; inline" }
|
|
{ $description
|
|
"Declares the most recently defined word as an inline word. The optimizing compiler copies definitions of inline words when compiling calls to them."
|
|
$nl
|
|
"Combinators must be inlined in order to compile with the optimizing compiler - see " { $link "inference-combinators" } ". For any other word, inlining is merely an optimization."
|
|
$nl
|
|
"The non-optimizing quotation compiler ignores inlining declarations."
|
|
} ;
|
|
|
|
HELP: foldable
|
|
{ $syntax ": foo ... ; foldable" }
|
|
{ $description
|
|
"Declares that the most recently defined word may be evaluated at compile-time if all inputs are literal. Foldable words must satisfy a very strong contract:"
|
|
{ $list
|
|
"foldable words must not have any observable side effects,"
|
|
"foldable words must halt - for example, a word computing a series until it coverges should not be foldable, since compilation will not halt in the event the series does not converge."
|
|
"both inputs and outputs of foldable words must be immutable."
|
|
}
|
|
"The last restriction ensures that words such as " { $link clone } " do not satisfy the foldable word contract. Indeed, " { $link clone } " will output a mutable object if its input is mutable, and so it is undesirable to evaluate it at compile-time, since doing so would give incorrect semantics for code that clones mutable objects and proceeds to mutate them."
|
|
}
|
|
{ $examples "Most operations on numbers are foldable. For example, " { $snippet "2 2 +" } " compiles to a literal 4, since " { $link + } " is declared foldable." } ;
|
|
|
|
HELP: flushable
|
|
{ $syntax ": foo ... ; flushable" }
|
|
{ $description
|
|
"Declares that the most recently defined word has no side effects, and thus calls to this word may be pruned by the compiler if the outputs are not used."
|
|
$nl
|
|
"Note that many words are flushable but not foldable, for example " { $link clone } " and " { $link <array> } "."
|
|
} ;
|
|
|
|
HELP: t
|
|
{ $syntax "t" }
|
|
{ $values { "t" "the canonical truth value" } }
|
|
{ $description "The canonical instance of " { $link general-t } ". It is just a symbol." } ;
|
|
|
|
HELP: f
|
|
{ $syntax "f" }
|
|
{ $values { "f" "the singleton false value" } }
|
|
{ $description "The " { $link f } " parsing word adds the " { $link f } " object to the parse tree, and is also the class whose sole instance is the " { $link f } " object. The " { $link f } " object is the singleton false value, the only object that is not true. The " { $link f } " object is not equal to the " { $link f } " class word, which can be pushed on the stack using word wrapper syntax:"
|
|
{ $code "f ! the singleton f object denoting falsity\n\\ f ! the f class word" } } ;
|
|
|
|
HELP: [
|
|
{ $syntax "[ elements... ]" }
|
|
{ $description "Marks the beginning of a literal quotation." }
|
|
{ $examples { $code "[ 1 2 3 ]" } } ;
|
|
|
|
{ POSTPONE: [ POSTPONE: ] } related-words
|
|
|
|
HELP: ]
|
|
{ $syntax "]" }
|
|
{ $description "Marks the end of a literal quotation."
|
|
$nl
|
|
"Parsing words can use this word as a generic end delimiter." } ;
|
|
|
|
HELP: }
|
|
{ $syntax "}" }
|
|
{ $description "Marks the end of an array, vector, hashtable, complex number, tuple, or wrapper."
|
|
$nl
|
|
"Parsing words can use this word as a generic end delimiter." } ;
|
|
|
|
{ POSTPONE: { POSTPONE: V{ POSTPONE: H{ POSTPONE: C{ POSTPONE: T{ POSTPONE: W{ POSTPONE: } } related-words
|
|
|
|
HELP: {
|
|
{ $syntax "{ elements... }" }
|
|
{ $values { "elements" "a list of objects" } }
|
|
{ $description "Marks the beginning of a literal array. Literal arrays are terminated by " { $link POSTPONE: } } "." }
|
|
{ $examples { $code "{ 1 2 3 }" } } ;
|
|
|
|
HELP: V{
|
|
{ $syntax "V{ elements... }" }
|
|
{ $values { "elements" "a list of objects" } }
|
|
{ $description "Marks the beginning of a literal vector. Literal vectors are terminated by " { $link POSTPONE: } } "." }
|
|
{ $examples { $code "V{ 1 2 3 }" } } ;
|
|
|
|
HELP: B{
|
|
{ $syntax "B{ elements... }" }
|
|
{ $values { "elements" "a list of integers" } }
|
|
{ $description "Marks the beginning of a literal byte array. Literal byte arrays are terminated by " { $link POSTPONE: } } "." }
|
|
{ $examples { $code "B{ 1 2 3 }" } } ;
|
|
|
|
HELP: BV{
|
|
{ $syntax "BV{ elements... }" }
|
|
{ $values { "elements" "a list of bytes" } }
|
|
{ $description "Marks the beginning of a literal byte vector. Literal byte vectors are terminated by " { $link POSTPONE: } } "." }
|
|
{ $examples { $code "BV{ 1 2 3 12 }" } } ;
|
|
|
|
HELP: ?{
|
|
{ $syntax "?{ elements... }" }
|
|
{ $values { "elements" "a list of booleans" } }
|
|
{ $description "Marks the beginning of a literal bit array. Literal bit arrays are terminated by " { $link POSTPONE: } } "." }
|
|
{ $examples { $code "?{ t f t }" } } ;
|
|
|
|
HELP: ?V{
|
|
{ $syntax "?V{ elements... }" }
|
|
{ $values { "elements" "a list of booleans" } }
|
|
{ $description "Marks the beginning of a literal bit vector. Literal bit vectors are terminated by " { $link POSTPONE: } } "." }
|
|
{ $examples { $code "?V{ t f t }" } } ;
|
|
|
|
HELP: FV{
|
|
{ $syntax "FV{ elements... }" }
|
|
{ $values { "elements" "a list of real numbers" } }
|
|
{ $description "Marks the beginning of a literal float vector. Literal float vectors are terminated by " { $link POSTPONE: } } "." }
|
|
{ $examples { $code "FV{ 1.0 2.0 3.0 }" } } ;
|
|
|
|
HELP: F{
|
|
{ $syntax "F{ elements... }" }
|
|
{ $values { "elements" "a list of real numbers" } }
|
|
{ $description "Marks the beginning of a literal float array. Literal float arrays are terminated by " { $link POSTPONE: } } "." }
|
|
{ $examples { $code "F{ 1.0 2.0 3.0 }" } } ;
|
|
|
|
HELP: H{
|
|
{ $syntax "H{ { key value }... }" }
|
|
{ $values { "key" "an object" } { "value" "an object" } }
|
|
{ $description "Marks the beginning of a literal hashtable, given as a list of two-element arrays holding key/value pairs. Literal hashtables are terminated by " { $link POSTPONE: } } "." }
|
|
{ $examples { $code "H{ { \"tuna\" \"fish\" } { \"jalapeno\" \"vegetable\" } }" } } ;
|
|
|
|
HELP: C{
|
|
{ $syntax "C{ real-part imaginary-part }" }
|
|
{ $values { "real-part" "a real number" } { "imaginary-part" "a real number" } }
|
|
{ $description "Parses a complex number given in rectangular form as a pair of real numbers. Literal complex numbers are terminated by " { $link POSTPONE: } } "." } ;
|
|
|
|
HELP: T{
|
|
{ $syntax "T{ class delegate slots... }" }
|
|
{ $values { "class" "a tuple class word" } { "delegate" "a delegate" } { "slots" "list of objects" } }
|
|
{ $description "Marks the beginning of a literal tuple. Literal tuples are terminated by " { $link POSTPONE: } } "."
|
|
$nl
|
|
"The class word must always be specified. If an insufficient number of values is given after the class word, the remaining slots of the tuple are set to " { $link f } ". If too many values are given, they are ignored." } ;
|
|
|
|
HELP: W{
|
|
{ $syntax "W{ object }" }
|
|
{ $values { "object" "an object" } }
|
|
{ $description "Marks the beginning of a literal wrapper. Literal wrappers are terminated by " { $link POSTPONE: } } "." } ;
|
|
|
|
HELP: POSTPONE:
|
|
{ $syntax "POSTPONE: word" }
|
|
{ $values { "word" "a word" } }
|
|
{ $description "Reads the next word from the input string and appends the word to the parse tree, even if it is a parsing word." }
|
|
{ $examples "For an ordinary word " { $snippet "foo" } ", " { $snippet "foo" } " and " { $snippet "POSTPONE: foo" } " are equivalent; however, if " { $snippet "foo" } " is a parsing word, the former will execute it at parse time, while the latter will execute it at runtime." }
|
|
{ $notes "This word is used inside parsing words to delegate further action to another parsing word, and to refer to parsing words literally from literal arrays and such." } ;
|
|
|
|
HELP: :
|
|
{ $syntax ": word definition... ;" }
|
|
{ $values { "word" "a new word to define" } { "definition" "a word definition" } }
|
|
{ $description "Defines a word in the current vocabulary." }
|
|
{ $examples { $code ": ask-name ( -- name )\n \"What is your name? \" write readln ;\n: greet ( name -- )\n \"Greetings, \" write print ;\n: friend ( -- )\n ask-name greet ;" } } ;
|
|
|
|
{ POSTPONE: : POSTPONE: ; define } related-words
|
|
|
|
HELP: ;
|
|
{ $syntax ";" }
|
|
{ $description
|
|
"Marks the end of a definition."
|
|
$nl
|
|
"Parsing words can use this word as a generic end delimiter."
|
|
} ;
|
|
|
|
HELP: SYMBOL:
|
|
{ $syntax "SYMBOL: word" }
|
|
{ $values { "word" "a new word to define" } }
|
|
{ $description "Defines a new symbol word in the current vocabulary. Symbols push themselves on the stack when executed, and are used to identify variables (see " { $link "namespaces" } ") as well as for storing crufties in word properties (see " { $link "word-props" } ")." }
|
|
{ $examples { $example "USE: prettyprint" "SYMBOL: foo\nfoo ." "foo" } } ;
|
|
|
|
{ define-symbol POSTPONE: SYMBOL: } related-words
|
|
|
|
HELP: \
|
|
{ $syntax "\\ word" }
|
|
{ $values { "word" "a word" } }
|
|
{ $description "Reads the next word from the input and appends a wrapper holding the word to the parse tree. When the evaluator encounters a wrapper, it pushes the wrapped word literally on the data stack." }
|
|
{ $examples "The following two lines are equivalent:" { $code "0 \\ <vector> execute\n0 <vector>" } } ;
|
|
|
|
HELP: DEFER:
|
|
{ $syntax "DEFER: word" }
|
|
{ $values { "word" "a new word to define" } }
|
|
{ $description "Create a word in the current vocabulary that simply raises an error when executed. Usually, the word will be replaced with a real definition later." }
|
|
{ $notes "Due to the way the parser works, words cannot be referenced before they are defined; that is, source files must order definitions in a strictly bottom-up fashion. Mutually-recursive pairs of words can be implemented by " { $emphasis "deferring" } " one of the words in the pair allowing the second word in the pair to parse, then by defining the first word." }
|
|
{ $examples { $code "DEFER: foe\n: fie ... foe ... ;\n: foe ... fie ... ;" } } ;
|
|
|
|
HELP: FORGET:
|
|
{ $syntax "FORGET: word" }
|
|
{ $values { "word" "a word" } }
|
|
{ $description "Removes the word from its vocabulary, or does nothing if no such word exists. Existing definitions that reference forgotten words will continue to work, but new occurrences of the word will not parse." } ;
|
|
|
|
HELP: USE:
|
|
{ $syntax "USE: vocabulary" }
|
|
{ $values { "vocabulary" "a vocabulary name" } }
|
|
{ $description "Adds a new vocabulary at the front of the search path. Subsequent word lookups by the parser will search this vocabulary first." }
|
|
{ $errors "Throws an error if the vocabulary does not exist." } ;
|
|
|
|
HELP: USING:
|
|
{ $syntax "USING: vocabularies... ;" }
|
|
{ $values { "vocabularies" "a list of vocabulary names" } }
|
|
{ $description "Adds a list of vocabularies to the front of the search path, with later vocabularies taking precedence." }
|
|
{ $errors "Throws an error if one of the vocabularies does not exist." } ;
|
|
|
|
HELP: IN:
|
|
{ $syntax "IN: vocabulary" }
|
|
{ $values { "vocabulary" "a new vocabulary name" } }
|
|
{ $description "Sets the current vocabulary where new words will be defined, creating the vocabulary first if it does not exist. After the vocabulary has been created, it can be listed in " { $link POSTPONE: USE: } " and " { $link POSTPONE: USING: } " declarations." } ;
|
|
|
|
HELP: CHAR:
|
|
{ $syntax "CHAR: token" }
|
|
{ $values { "token" "a literal character, escape code, or Unicode character name" } }
|
|
{ $description "Adds a Unicode code point to the parse tree." }
|
|
{ $examples
|
|
{ $code
|
|
"CHAR: x"
|
|
"CHAR: \\u000032"
|
|
"CHAR: \\u{exclamation-mark}"
|
|
"CHAR: exclamation-mark"
|
|
"CHAR: ugaritic-letter-samka"
|
|
}
|
|
} ;
|
|
|
|
HELP: "
|
|
{ $syntax "\"string...\"" }
|
|
{ $values { "string" "literal and escaped characters" } }
|
|
{ $description "Reads from the input string until the next occurrence of " { $link POSTPONE: " } ", and appends the resulting string to the parse tree. String literals cannot span multiple lines. Strings containing the " { $link POSTPONE: " } " character and various other special characters can be read by inserting escape sequences." }
|
|
{ $examples { $example "USE: io" "\"Hello\\nworld\" print" "Hello\nworld" } } ;
|
|
|
|
HELP: SBUF"
|
|
{ $syntax "SBUF\" string... \"" }
|
|
{ $values { "string" "literal and escaped characters" } }
|
|
{ $description "Reads from the input string until the next occurrence of " { $link POSTPONE: " } ", converts the string to a string buffer, and appends it to the parse tree." }
|
|
{ $examples { $example "USING: io strings ;" "SBUF\" Hello world\" >string print" "Hello world" } } ;
|
|
|
|
HELP: P"
|
|
{ $syntax "P\" pathname\"" }
|
|
{ $values { "pathname" "a pathname string" } }
|
|
{ $description "Reads from the input string until the next occurrence of " { $link POSTPONE: " } ", creates a new " { $link pathname } ", and appends it to the parse tree." }
|
|
{ $examples { $example "USING: io io.files ;" "P\" foo.txt\" pathname-string print" "foo.txt" } } ;
|
|
|
|
HELP: (
|
|
{ $syntax "( inputs -- outputs )" }
|
|
{ $values { "inputs" "a list of tokens" } { "outputs" "a list of tokens" } }
|
|
{ $description "Declares the stack effect of the most recently defined word, storing a new " { $link effect } " instance in the " { $snippet "\"declared-effect\"" } " word property." }
|
|
{ $notes "Recursive words must have a declared stack effect to compile. See " { $link "effect-declaration" } " for details." } ;
|
|
|
|
HELP: !
|
|
{ $syntax "! comment..." }
|
|
{ $values { "comment" "characters" } }
|
|
{ $description "Discards all input until the end of the line." } ;
|
|
|
|
{ POSTPONE: ! POSTPONE: #! } related-words
|
|
|
|
HELP: #!
|
|
{ $syntax "#! comment..." }
|
|
{ $values { "comment" "characters" } }
|
|
{ $description "Discards all input until the end of the line." } ;
|
|
|
|
HELP: HEX:
|
|
{ $syntax "HEX: integer" }
|
|
{ $values { "integer" "hexadecimal digits (0-9, a-f, A-F)" } }
|
|
{ $description "Adds an integer read from a hexadecimal literal to the parse tree." }
|
|
{ $examples { $example "USE: prettyprint" "HEX: ff ." "255" } } ;
|
|
|
|
HELP: OCT:
|
|
{ $syntax "OCT: integer" }
|
|
{ $values { "integer" "octal digits (0-7)" } }
|
|
{ $description "Adds an integer read from an octal literal to the parse tree." }
|
|
{ $examples { $example "USE: prettyprint" "OCT: 31337 ." "13023" } } ;
|
|
|
|
HELP: BIN:
|
|
{ $syntax "BIN: integer" }
|
|
{ $values { "integer" "binary digits (0 and 1)" } }
|
|
{ $description "Adds an integer read from an binary literal to the parse tree." }
|
|
{ $examples { $example "USE: prettyprint" "BIN: 100 ." "4" } } ;
|
|
|
|
HELP: GENERIC:
|
|
{ $syntax "GENERIC: word" }
|
|
{ $values { "word" "a new word to define" } }
|
|
{ $description "Defines a new generic word in the current vocabulary. Initially, it contains no methods, and thus will throw a " { $link no-method } " error when called." } ;
|
|
|
|
HELP: GENERIC#
|
|
{ $syntax "GENERIC# word n" }
|
|
{ $values { "word" "a new word to define" } { "n" "the stack position to dispatch on, either 0, 1 or 2" } }
|
|
{ $description "Defines a new generic word which dispatches on the " { $snippet "n" } "th most element from the top of the stack in the current vocabulary. Initially, it contains no methods, and thus will throw a " { $link no-method } " error when called." }
|
|
{ $notes
|
|
"The following two definitions are equivalent:"
|
|
{ $code "GENERIC: foo" }
|
|
{ $code "GENERIC# foo 0" }
|
|
} ;
|
|
|
|
HELP: MATH:
|
|
{ $syntax "MATH: word" }
|
|
{ $values { "word" "a new word to define" } }
|
|
{ $description "Defines a new generic word which uses the " { $link math-combination } " method combination." } ;
|
|
|
|
HELP: HOOK:
|
|
{ $syntax "HOOK: word variable" }
|
|
{ $values { "word" "a new word to define" } { "variable" word } }
|
|
{ $description "Defines a new hook word in the current vocabulary. Hook words are generic words which dispatch on the value of a variable, so methods are defined with " { $link POSTPONE: M: } ". Hook words differ from other generic words in that the dispatch value is removed from the stack before the chosen method is called." }
|
|
{ $examples
|
|
{ $example
|
|
"USING: io namespaces ;"
|
|
"SYMBOL: transport"
|
|
"TUPLE: land-transport ;"
|
|
"TUPLE: air-transport ;"
|
|
"HOOK: deliver transport ( destination -- )"
|
|
"M: land-transport deliver \"Land delivery to \" write print ;"
|
|
"M: air-transport deliver \"Air delivery to \" write print ;"
|
|
"T{ air-transport } transport set"
|
|
"\"New York City\" deliver"
|
|
"Air delivery to New York City"
|
|
}
|
|
}
|
|
{ $notes
|
|
"Hook words are really just generic words with a custom method combination (see " { $link "method-combination" } ")."
|
|
} ;
|
|
|
|
HELP: M:
|
|
{ $syntax "M: class generic definition... ;" }
|
|
{ $values { "class" "a class word" } { "generic" "a generic word" } { "definition" "a method definition" } }
|
|
{ $description "Defines a method, that is, a behavior for the generic word specialized on instances of the class." } ;
|
|
|
|
HELP: UNION:
|
|
{ $syntax "UNION: class members... ;" }
|
|
{ $values { "class" "a new class word to define" } { "members" "a list of class words separated by whitespace" } }
|
|
{ $description "Defines a union class. An object is an instance of a union class if it is an instance of one of its members." }
|
|
{ $notes "Union classes are used to associate the same method with several different classes, as well as to conveniently define predicates." } ;
|
|
|
|
HELP: MIXIN:
|
|
{ $syntax "MIXIN: class" }
|
|
{ $values { "class" "a new class word to define" } }
|
|
{ $description "Defines a mixin class. A mixin is similar to a union class, except it has no members initially, and new members can be added with the " { $link POSTPONE: INSTANCE: } " word." }
|
|
{ $notes "Mixins classes are used to mark implementations of a protocol and define default methods." }
|
|
{ $examples "The " { $link sequence } " and " { $link assoc } " mixin classes." } ;
|
|
|
|
HELP: INSTANCE:
|
|
{ $syntax "INSTANCE: instance mixin" }
|
|
{ $values { "instance" "a class word" } { "instance" "a class word" } }
|
|
{ $description "Makes " { $snippet "instance" } " an instance of " { $snippet "mixin" } "." } ;
|
|
|
|
HELP: PREDICATE:
|
|
{ $syntax "PREDICATE: superclass class predicate... ;" }
|
|
{ $values { "superclass" "an existing class word" } { "class" "a new class word to define" } { "predicate" "membership test with stack effect " { $snippet "( superclass -- ? )" } } }
|
|
{ $description
|
|
"Defines a predicate class deriving from " { $snippet "superclass" } "."
|
|
$nl
|
|
"An object is an instance of a predicate class if two conditions hold:"
|
|
{ $list
|
|
"it is an instance of the predicate's superclass,"
|
|
"it satisfies the predicate"
|
|
}
|
|
"Each predicate must be defined as a subclass of some other class. This ensures that predicates inheriting from disjoint classes do not need to be exhaustively tested during method dispatch."
|
|
} ;
|
|
|
|
HELP: TUPLE:
|
|
{ $syntax "TUPLE: class slots... ;" }
|
|
{ $values { "class" "a new tuple class to define" } { "slots" "a list of slot names" } }
|
|
{ $description "Defines a new tuple class."
|
|
$nl
|
|
"Tuples are user-defined classes with instances composed of named slots. All tuple classes are subtypes of the built-in " { $link tuple } " type." } ;
|
|
|
|
HELP: ERROR:
|
|
{ $syntax "ERROR: class slots... ;" }
|
|
{ $values { "class" "a new tuple class to define" } { "slots" "a list of slot names" } }
|
|
{ $description "Defines a new tuple class. Defines a new word " { $snippet "class?" } " that boa-constructs this tuple and throws it." } ;
|
|
|
|
{ POSTPONE: ERROR: POSTPONE: TUPLE: } related-words
|
|
|
|
HELP: C:
|
|
{ $syntax "C: constructor class" }
|
|
{ $values { "constructor" "a new word to define" } { "class" tuple-class } }
|
|
{ $description "Define a constructor word for a tuple class which simply performs BOA (by order of arguments) construction using " { $link construct-boa } "." }
|
|
{ $examples
|
|
"Suppose the following tuple has been defined:"
|
|
{ $code "TUPLE: color red green blue ;" }
|
|
"The following two lines are equivalent:"
|
|
{ $code
|
|
"C: <color> color"
|
|
": <color> color construct-boa ;"
|
|
}
|
|
"In both cases, a word " { $snippet "<color>" } " is defined, which reads three values from the stack and creates a " { $snippet "color" } " instance having these values in the " { $snippet "red" } ", " { $snippet "green" } " and " { $snippet "blue" } " slots, respectively."
|
|
} ;
|
|
|
|
HELP: MAIN:
|
|
{ $syntax "MAIN: word" }
|
|
{ $values { "word" word } }
|
|
{ $description "Defines the main entry point for the current vocabulary. This word will be executed when this vocabulary is passed to " { $link run } "." } ;
|
|
|
|
HELP: <PRIVATE
|
|
{ $syntax "<PRIVATE ... PRIVATE>" }
|
|
{ $description "Marks the start of a block of private word definitions. Private word definitions are placed in a vocabulary named by suffixing the current vocabulary with " { $snippet ".private" } "." }
|
|
{ $notes
|
|
"The following is an example of usage:"
|
|
{ $code
|
|
"IN: factorial"
|
|
""
|
|
"<PRIVATE"
|
|
""
|
|
": (fac) ( accum n -- n! )"
|
|
" dup 1 <= [ drop ] [ [ * ] keep 1- (fac) ] if ;"
|
|
""
|
|
"PRIVATE>"
|
|
""
|
|
": fac ( n -- n! ) 1 swap (fac) ;"
|
|
}
|
|
"The above is equivalent to:"
|
|
{ $code
|
|
"IN: factorial.private"
|
|
""
|
|
": (fac) ( accum n -- n! )"
|
|
" dup 1 <= [ drop ] [ [ * ] keep 1- (fac) ] if ;"
|
|
""
|
|
"IN: factorial"
|
|
""
|
|
": fac ( n -- n! ) 1 swap (fac) ;"
|
|
}
|
|
} ;
|
|
|
|
HELP: PRIVATE>
|
|
{ $syntax "<PRIVATE ... PRIVATE>" }
|
|
{ $description "Marks the end of a block of private word definitions." } ;
|
|
|
|
{ POSTPONE: <PRIVATE POSTPONE: PRIVATE> } related-words
|
|
|
|
HELP: <<
|
|
{ $syntax "<< ... >>" }
|
|
{ $description "Evaluates some code at parse time." }
|
|
{ $notes "Calling words defined in the same source file at parse time is prohibited; see compilation unit as where it was defined; see " { $link "compilation-units" } "." } ;
|
|
|
|
HELP: >>
|
|
{ $syntax ">>" }
|
|
{ $description "Marks the end of a parse time code block." } ;
|
|
|
|
{ POSTPONE: << POSTPONE: >> } related-words
|