book_open Bookmaker for WebOrder
Change book Close bookmaker
Add to book Remove from book
application_side_expand
You can change the order/nesting of topics using drag and drop
application_side_contract

internal package Foswiki::Infix

See PublishedAPI for packages intended to be used by Plugin and Contrib authors, or browse all packages.
See also Developing plugins, Developer's Bible, Technical Overview

  • Foswiki::Infix::Error - Class of errors used with Foswiki::Infix::Parser
  • Foswiki::Infix::Node - Base class for node types generated by Infix::Parser (and its subclasses). This defines the interface used to construct nodes from the parser.
  • Foswiki::Infix::OP - Base class of operators recognised by the Foswiki::Infix::Parser. Predefined fields in this object used by Foswiki::Infix::Parser are: * name - operator string. * prec - operator precedence, positive non-zero integer. Larger number > higher precedence.    * =arity - set to 1 if this operator is unary, 2 for binary. Arity 0 is legal, should you ever need it. Use arity=2 and canfold=1 for n-ary operators. * close - used with bracket operators. name should be the open bracket string, and close the close bracket. The existance of close marks this as a bracket operator. * casematters= - indicates that the parser should check case in the operator name (i.e. treat 'AND' and 'and' as different). By default operators are case insensitive. Note that operator names must be caselessly unique i.e. you can't define 'AND' and 'and' as different operators in the same parser. Does not affect the interpretation of non-operator terminals (names). * canfold - means that adjacent nodes with identical operators can be folded together i.e. the operands of the second node can be pushed onto the parameter list of the first. This is used (for example) for comma lists. Other fields in the object can be used for other purposes. However field names in the hash starting with InfixParser_ are reserved for use by the parser.
  • Foswiki::Infix::Parser - A simple LL(1) parser that parses infix expressions with nonary, unary and binary operators specified using an operator table.

Topic revision: r1 - 03 Feb 2016, UnknownUser
This site is powered by FoswikiCopyright © by the contributing authors. All material on this site is the property of the contributing authors.
Ideas, requests, problems regarding DAMASK? Send feedback