module AsciiMath

Parser for ASCIIMath expressions.

The syntax for ASCIIMath in EBNF style notation is

expr = ( simp ( fraction | sub | super ) )+ simp = constant | paren_expr | unary_expr | binary_expr | text fraction = '/' simp super = '^' simp sub = '_' simp super? paren_expr = lparen expr rparen lparen = '(' | '[' | '{' | '(:' | '{:' rparen = ')' | ']' | '}' | ':)' | ':}' unary_expr = unary_op simp unary_op = 'sqrt' | 'text' binary_expr = binary_op simp simp binary_op = 'frac' | 'root' | 'stackrel' text = '“' [^”]* '“' constant = number | symbol | identifier number = '-'? [0-9]+ ( '.' [0-9]+ )? symbol = /* any string in the symbol table */ identifier = [A-z]

ASCIIMath is parsed left to right without any form of operator precedence. When parsing the 'constant' the parser will try to find the longest matching string in the symbol table starting at the current position of the parser. If no matching string can be found the character at the current position of the parser is interpreted as an identifier instead.

Constants

VERSION

Public Class Methods

parse(asciimath, parser_symbol_table = ::AsciiMath::Parser::DEFAULT_PARSER_SYMBOL_TABLE, parser_color_table = ::AsciiMath::Parser::DEFAULT_COLOR_TABLE) click to toggle source

# File lib/asciimath/parser.rb, line 774
def self.parse(asciimath, parser_symbol_table = ::AsciiMath::Parser::DEFAULT_PARSER_SYMBOL_TABLE, parser_color_table = ::AsciiMath::Parser::DEFAULT_COLOR_TABLE)
  Parser.new(parser_symbol_table, parser_color_table).parse(asciimath)
end