converts a Maple procedure to an abstract syntax tree

はじめる前に
新機能一覧
Maple ワークシートの作成
Mapleワークシートを共有
Maple ウィンドウのカスタマイズ
Maple システムのカスタマイズ
コネクティビティ
Mathematics
数学
物理
プログラミング
グラフィックス
Student パッケージ
Science and Engineering
科学・エンジニアリング
アプリケーションと例題
リファレンス
システム
- CUDA パッケージ
- InstallerBuilder パッケージ
- コンテキストメニュー
- セキュリティ
- ヘルプ
- ユーティリティ
- ライブラリとパッケージ
  - ライブラリツールズ
  - 非推奨パッケージおよびコマンド
    - 非推奨コマンド
    - 非推奨パッケージ
  - libname
  - march
  - Rebound
  - unwith
  - ただし、
  - パッケージインデックス
  - パッケージの使用法
  - リポジトリ
  - リポジトリの管理
  - 共有
- 外部関数
- 統計情報
- GMP ライブラリ
- GMP ライブラリの例題
- Maple カーネルプロセス
- Maple バージョン
- sigpipe エラー
- アップデートの確認
- グラフ電卓
- プラットフォームに関する問題
- メモリアロケーションエラー
- ワークシートの互換性
- ワークシート移行アシスタント
- 数学辞書
- 警告メッセージ
MapleSim
MapleSim ツールボックス
MapleSim ヘルプ
Tasks
Toolboxes
エラーメッセージガイド
マニュアル
数学アプリ

codegen[maple2intrep] - converts a Maple procedure to an abstract syntax tree

codegen[intrep2maple] - converts an abstract syntax tree to a Maple procedure

	Calling Sequence
	maple2intrep(f) intrep2maple(t)

Parameters

f	-	Maple procedure
t	-	expression (an abstract syntax tree)

Description

•	Important: The maple2intrep and intrep2maple commands have been deprecated. Use the superseding commands ToInert and FromInert instead to translate between Maple expressions and corresponding inert forms.

•

The maple2intrep function is used to convert a Maple procedure f into an intermediate representation for the procedure that is suitable for manipulating the code of f. The intermediate representation is an abstract syntax tree. The maple2intrep function also deduces the types of all parameters, local variables, and global variables in f. The intrep2maple function is used to convert an abstract syntax tree t to a Maple procedure.

•	The abstract syntax tree has the following structure. Express it by using a modified BNF grammar where:

* indicates zero or more occurrences

+ indicates one or more occurrences

[] indicate optional terms, and

| indicates alternatives.

tree ::= Proc( Name( declaration ),

Parameters( declaration* ),

Options( sequence ),

Description( string ),

Locals( declaration* ),

Globals( declarations* ),

StatSeq( statement* ) )

declaration ::= name :: type

statseq ::= StatSeq( statement* )

statement ::= expression |

Assign( name, expression ) |

If( [condition, statseq]+, [statseq] ) |

For( name, from, by, to, while, statseq ) |

For( name, in, while, statseq ) |

Return( sequence ) |

Error( sequence ) |

Break( ) |

Next( ) |

Read( string ) |

Save( sequence ) |

Comment( ... ) |

Quote( expression ) |

Ditto1( ) |

Ditto2( ) |

Ditto3( ) |

tree |

Nargs( ) | Args[i] | Args

•	In the abstract syntax tree, the names and Maple expressions become global and will evaluate.

Note: In the event that the parameter or local names in the procedure have global values, and it is desirable to use local names instead (to prevent evaluation problems with respect to the variable names), the option can be used.

When working with the abstract syntax tree, be careful not to evaluate parts of the tree, or else, use the `tools/rename` command to rename all symbols in the tree to unique names that do not evaluate. The library routine `tools/unrename` can be used to undo this renaming. An example is given below.

Examples

Important: The maple2intrep and intrep2maple commands have been deprecated. Use the superseding commands ToInert and FromInert instead to translate between Maple expressions and corresponding inert forms.

>	f := proc(x) local t; t := sin(x); x*t end proc:

(1)

(2)

(3)

(4)

(5)

This example shows the problem of evaluation.

>	f := proc(x,n) local i,t,A; A := array(1..n); t := 1; for i to n do t := x*t; A[i] := t; end do; A end proc:

tree := Proc(Name(f .. List(1 .. n, float)), Parameters(x .. float, n .. integer), Options(), Description(), Locals(i .. integer, t .. float, A .. List(1 .. n, float)), Globals(), StatSeq(Assign(A, array(1 .. n)), Assign(t, 1), For(i, 1, 1, n, true, StatSeq(Assign(t, x*t), Assign(A[i], t))), A))

(6)

Error, non-integer ranges in array/table creation

Proc(Name(f .. List(1 .. n, float)), Parameters(x .. float, n .. integer), Options(), Description(), Locals(i .. integer, t .. float, A .. List(1 .. n, float)), Globals(), StatSeq(Assign(A, array(1 .. n)), Assign(t, 1), For(i, 1, 1, n, true, StatSeq(Assign(t, x*t), Assign(A[i], t))), A))

(7)

(8)

Rename all symbols in the program with new names.

(9)

(10)

(11)

(12)

(13)

(14)

Make a simple transformation on the program represented in the intermediate representation. Make the array A into a global variable.

(15)

(16)

tree := Proc(Name(f .. List(1 .. n, float)), Parameters(x .. float, n .. integer), Options(), Description(), Locals(i .. integer, t .. float), Globals(A), StatSeq(Assign(A, array(1 .. n)), Assign(t, 1), For(i, 1, 1, n, true, StatSeq(Assign(t, x*t), Assign(A[i], t))), A))

(17)

(18)

This example shows the problem of evaluation in a case where use of `tools/rename` is insufficient for the task (so you must use outputvars=locals instead).

>	f := proc(X,n) local i; for i to n do X[i] := 0; end do; end proc;

(19)

(20)

Error, (in `intrep/type/bodyscan`) bad index into Array

tree := Proc(Name(f .. integer), Parameters(X .. float, n .. float), Options(), Description(), Locals(i .. integer), Globals(), StatSeq(For(i, 1, 1, n, true, StatSeq(Assign(X[i], 0)))))