SOURCE CODE CONVERSION METHOD, RECORDING MEDIUM RECORDING SOURCE CODE CONVERSION PROGRAMS AND SOURCE CODE CONVERSION DEVICE

Japanese Patent JP3430252

B2

PROBLEM TO BE SOLVED: To convert abstract sentence structuring tree to a set of characters by expressing the abstract sentence structuring tree without node for describing formula sentence.
SOLUTION: Kind of root node in abstract sentence structuring tree is if sentence (T17). The tree diverges and calls 'Procedure for outputting the if sentence'. By the procedure, the tree firstly outputs a set of characters 'if' (to output content of the first sub-tree, 'x==0', 'procedure for outputting the abstract sentence structuring tree as formula' is recurrently called). To output content of the second sub-tree, 'y=0;', 'the procedure for outputting the abstract sentence structuring tree as formula' is recurrently called, and a set of characters, 'else' is output. To output content of the third sub-tree (T72), 'y=1', 'the procedure for outputting the abstract sentence structuring tree as formula' is recurrently called. As a result, the input is output as a set of characters, 'if (x==0) y=0; else y=1;'.

Hiroshi Hitosugi

JP2000015021A

July 28, 2003

January 24, 2000

Click for automatic bibliography generation  

National Institute of Advanced Industrial Science and Technology

G06F9/44; G06F9/45; (IPC1-7): G06F9/45

JP11249903A
JP1196016A
JP5250174A
JP8272622A
JP1175035A

一杉裕志，拡張可能ＪａｖａプリプロセッサＥＰＰ，Ｃｏｍｐｕｔｅｒ Ｔｏｄａｙ，株式会社サイエンス社，１９９８年１１月１日，第１５巻第６号，ｐ．１２−１７
一杉裕志，高いモジュラリティと拡張性を持つ構文解析器，情報処理学会論文誌，社団法人情報処理学会，１９９８年１２月１５日，第３９巻ＳＩＧ１号，ｐ．６１−６９
阿部洋丈ほか２名，ソースコード変換技術を用いたＪａｖａ言語におけるスレッドのモビリティの実現法，情報処理学会論文誌，社団法人情報処理学会，２０００年３月１５日，第４１巻ＳＩＧ（ＰＲＯ６）号，ｐ．２９−４０

Previous Patent: TRAFFIC SIGN POST

Next Patent: MAGNET ARRANGEMENT METHOD AND MAGNETIC INDUCTION METHOD