Titlebook: Maple V Language Reference Manual; Bruce W. Char,Keith O. Geddes,Stephen M. Watt Textbook 19911st edition Waterloo Maple Publishing 1991 M

影響深遠(yuǎn)

Introduction,n fact it was simply chosen as a name with a Canadian identity.) The type of computation provided by Maple is known by various other names such as ., or . A basic feature of such a language is the ability to, explicitly or implicitly, leave the elements of a computation unevaluated. A corresponding

COUCH

Data Types,y internal use, most of the data types corresponding to expressions are accessible to the user and can be tested for via the type function. The user can examine the components of such a data type by using the op function, and the corresponding nops function can be used to query the . of an expressio

Melanocytes

RAFF

vibrant

Internal Representation and Manipulation,main program reads input, calls the parser, and then calls the statement evaluator for each complete statement encountered. The parser accepts the Maple language that has been kept simple enough to have the LALR(1) property. For each production which is successfully reduced, it creates the appropria

混沌

Plotting,about a function. By just glancing at a picture of a function, one can see its zeros, local minima and local maxima, as well other interesting properties. Maple provides the plot command and the plot3d command for graphing functions of one variable and two variables respectively.

Lipoprotein

Miscellaneous Facilities,ternal to Maple and then to use the Mint facility to detect any syntax errors. Mint is a program distinct from Maple. It inspects a specified file that is assumed to be a Maple source file and produces a report on syntax errors encountered and on how variables are used.

駭人

Overview of the Maple Library,ertise resides. The library routines are available for your inspection, study, and when appropriate, modification and extension. Each of these routines is written in the Maple programming language. Through the library, the Maple system and the algorithms that it uses can be dynamically extended and

CLASH

Type Testing,d any valid Maple object. In principle Maple has no declarations, it is up to the functions and up to the user to enforce typing restrictions. For example.are examples of truly polymorphic operations. The expression . stands for any valid Maple structure. The operations indicated will be performed with any type of operand.

biosphere

Arrays and Tables,be integer expression sequences lying within user-specified bounds. Arrays are used similarly to those in other programming languages, while tables correspond roughly to the ones provided in Snobol or Icon.