BROOM A Matrix Language - field is being used for creating 扫帚矩阵语言场被用于创建.pptVIP

BROOM: A Matrix Language Chris Tobin Michael Weiss Gabe Glaser Brian Pellegrini Broom Overview and Summary A high-level language for manipulating matrices Many useful built in matrix operations. Ability to define and build more complicated functions for specialized analysis of information Motivation Matrices are universal mathematical constructs Learning curve is not as steep Specialized use, without extraneous things to understand other than what you need it for. No need for expensive software Goals Intuitive syntax High level Very portable Flexible Useful and informative error checking Broom Syntax Intuitive for ( ) … endfor Freeform whitespace inserted at will Smooth built-in matrix operation syntax A = inv(B); // finds the inverse of B Features: Control flow constructs: for, while, if Nested logical operators and expressions A wide range of built-in functions Built-in Functions Many useful built-in function calls: det colswap, rowswap inv gauss appendUD, appendLR setCol, setRow Too numerous to list…22 total Semantics Broom features: Function definitions Allow for modularity, power, and reusable code. Variable definitions Two intuitive mathematical types Number Matrix Scoping rules: local – for functions global – accessible by all All functions call-by-value for simplicity Compiler Components and Composition There are 5 main components of BCC, the Broom translator Lexer Parser Static Semantics Checker W/Symbol Tables BroomMatrix.java Contains Matrix manipulation code and functions Code Generator ANTLR The Lexer and Parser were implemented using ANTLR. ANTLR’s AST class was used to create the Abstract Syntax Tree and Nodes. The Static Semantics Checker was implemented as a TreeWalker of the ANTLR AST and maintained Symbol Tables for the various scopes. Symbol Tables were written as a simple Java class Code Generator was also implemented as a TreeWalker of ANTLR AST. Accumulates a “program string” as it walks the AST and prints string to file upon f