KS X ISO IEC 14568-2009 Information technology－DXL：Diagram eXchange Language for tree-structured charts《信息技术 DXL 树结构化图形的图交换语言》.pdf

《KS X ISO IEC 14568-2009 Information technology－DXL：Diagram eXchange Language for tree-structured charts《信息技术 DXL 树结构化图形的图交换语言》.pdf》由会员分享，可在线阅读，更多相关《KS X ISO IEC 14568-2009 Information technology－DXL：Diagram eXchange Language for tree-structured charts《信息技术 DXL 树结构化图形的图交换语言》.pdf（22页珍藏版）》请在麦多课文档分享上搜索。

1、 KSKSKSKS KSKSKSK KSKSKS KSKSK KSKS KSK KS KS X ISO/IEC 14568 (DXL) KS X ISO/IEC 14568 :2009 2009 12 29 http:/www.kats.go.krKS X ISO/IEC 14568:2009 : ( ) ( ) () ( ) S J ( ) : (JTC1/SC22) () ( ) ( ) : (http:/www.standard.go.kr) ： ：1998 12 31 ：2009 12 29 2009-0928 ： ：(JTC1/SC22) ( 02-509-7262) (http:/

2、www.kats.go.kr). 10 5 , . KS X ISO/IEC 14568:2009 i ii 1 1 2 1 3 .2 4 DXL 2 5 DXL .2 5.1 (lexical elements) .2 5.2 (Module Packet) .3 5.3 (Profile Paragraph)3 5.4 (Module Identification Paragraph).4 5.5 (Module Algorithm Paragraph).4 A() DXL 8 B() DXL KS X 2210 .12 C() DXL ()14 KS X ISO/IEC 14568:20

3、09 .15 KS X ISO/IEC 14568:2009 ii . ISO/IEC 2 1997 1 ISO/IEC 14568, Information technologyDXL：Diagram eXchange Language for tree-structured charts . . ISO IEC . ISO/IEC JTC1/ SC22() . KS X ISO/IEC 14568:2009 (DXL) Information technologyDXL：Diagram eXchange Language for tree-structured charts 1 DXL .

4、 DXL CASE . DXL .： 1. KS X 2210 ( A ) 2. KS X ISO 5807 (well-structured) KS X ISO 5807 3. (procedure oriented algorithm) . 1. (, , ) 2. (, , ) 3. DXL (, , , ) 2 . . ( ) . KS X ISO 5807, , , KS X ISO/IEC 88591, 8 1： 1 KS X ISO/IEC 10646, (UCS) , ISO/IEC 646：1991, Information processingISO 7-bit coded

5、 character set for information interchange KS X 1003：1993 () . ISO/IEC 2022：1986, Information processingISO 7-bit and 8-bit coded character setsCode extension techniques KS X 1004：1977( ) . ISO/IEC 4873：1991, Information processingISO 8-bit code for information interchangeStructure and rules for imp

6、lementation KS X 1006：1995( ISO 8 ) . KS X ISO/IEC 14568:2009 2 ISO/IEC 8631：1989, Information technologyProgram constructs and conventions for their representation KS X 2210：1990( ) . 3 . 3.1 3.1.1 (tree-structured chart) KS X 2210 3.2 3.2.1 CASE Computer Aided Software Engineering 4 DXL (syntax) B

7、ackusNaur Form , . 1 . 1 := is defined to be | alternatively A 0 or 1 instance of A A 0 or more instances of A XYZ terminal symbol XYZ of level 0 “XYZ” terminal symbol XYZ of level 1 nonterminal symbol XYZ of level 0 nonterminal symbol XYZ of level 1 0 1 , 0 KS X 2210 , 1 0 . 5 DXL 5.1 (lexical elem

8、ents) := | := KS X ISO/IEC 14568:2009 3 := | | | | | | := ; | : | := M_Packet | End_M_Packet | Profile I End_Profile | Identification I End_Identification | Identifier I is | Module_Algorithm I End_Module_Algorithm | imperative I “null“ | “call“ I “goto“ | “abstract“ I begin | end I parallel | end_p

9、arallel | loop I end_loop | condition | “while“ | “until“ | “for“ | if | then | end_if | exclusive_select | else_if | else | end_exclusive_select | case | when | inclusive_select | end_inclusive_select | terminate | system | module | block := := | := | := - | := “%“ | “%“ KS X 1003, KS X 1004, KS X

10、1006 KS X ISO/IEC 88591 . KS X ISO/IEC 10646 , KS X 1003 . KS X 1003 , KS X 1003 HT. (delimiter) (, , , %, %, ;) (space) . module . . . (delimiter) . 5.2 (Module Packet) (Module Packet) CASE . := M_Packet End_M_Packet ; 5.3 (Profile Paragraph) (Profile Paragraph) . KS X ISO/IEC 14568:2009 4 := Profi

11、le End_Profile ; . , , , 4. 5.4 (Module Identification Paragraph) (Module Identification Paragraph) . := Identification Identifier is ; End_Identification ; (Module Packet) . . , usage, , , , , , , 5.5 (Module Algorithm Paragraph) (Module Algorithm Paragraph) . := Module_Algorithm End_Module_Algorit

12、hm ; 5.5.1 (Statement) := “:“ := | I := , , . 5.5.2 (Imperative Statement) KS X ISO/IEC 14568:2009 5 := imperative ; := := | | := “null“ := “call“ := := “goto“ KS X 2210 (Imperative Construct) , . . . . 5.5.3 (Blocked Statement) := “abstract“ := := := | | | KS X 2210 (Serial Statement), (Parallel St

13、atement), (Iterative Statement) (Selective Choice Statement) . (stepwise refinement) (abstract process description) , DXL A.1 . , . 5.5.4 (Serial Statement) := begin end ; KS X 2210 (Serial Construct) , . 5.5.5 (Parallel Statement) := parallel end_parallel ; KS X 2210 (Parallel Construct) , . KS X I

14、SO/IEC 14568:2009 6 5.5.6 (Iterative Statement) := | | : = condition loop end_loop ; := loop end_loop condition ; := loop end_loop ; := := “while“ | “until“ | “for“ := “while“ | “until“ KS X 2210 (Iterative Construct) , . . a) while： b) until： c) for： 5.5.7 (Selective Choice Statement) := | | := if

15、then end_if ; := | : = exclusive_select if then else_if then else end_exclusive_select ; := exclusive_select case when ; end_exclusive_select ; := := := inclusive_select case KS X ISO/IEC 14568:2009 7 when : end inclusive_select ; KS X 2210 (Selective Choice Construct) , . KS X 2210 2 (Dyadic Select

16、ive Construct) (Multiple Exclusive Selective Construct) . DXL . “true” (boolean) , “false” else . . KS X 2210 (Multiple Inclusive Selective Construct) . 5.5.8 (Termination Statement) := terminate ; := system | module I block KS X 2210 . . . . KS X ISO/IEC 14568:2009 8 A () DXL A.1 “Abstract” M_Packe

17、t Profile Codeset: default; Identifier: Max(32); Specification: default; Originated: HCPtools1.0; End_Profile; Identification Identifier is ; Title: Word count program; Module : int word_count(char ); Input : File name; Output : Number of word Function : Count the number of word in the input file; C

18、onstraints : Only English words can be counted; Revision : 06/05/95 H.T.; Design : 05/30/95 H.N.; End_Identification; - This is a sample chart - For experimental descriptions. Module_Algorithm abstract Count the number of words in a file begin abstract Pre-process begin imperative Open the file; imp

19、erative Initialize the word-counter; end; abstract Count the number of words loop imperative Read one record, if End-of-file then terminate block ;end_if; KS X ISO/IEC 14568:2009 9 abstract Count the number of words in the record loop abstract Search for words in the record begin abstract Search for

20、 a head character of a word loop abstract Search for a head character exclusive_select if Alphabetical Character then terminate block ; else_if Other character then imperative null ; else_if End-of-reco rd then terminate block ; end_exclusive_select; end_loop; abstract Search for a delimiter between

21、 words loop abstract Search for a head character of the delimiter exclusive_select if Alphabetical Character then imperative null ; else_if Other character then terminate block ; else_if End-of-reco rd then terminate block ; end_exclusive select; end_loop; end; imperative Add 1 to the value of the w

22、ord-counter; end_loop; end_loop; abstract Post-process begin imperative Close the file; end; end; End_Module_Algorithm; End_M_Packet; A.2 “Abstract” M_Packet Profile Codeset : default; Identifier : Mac(32); Specification : default; Originated : HCPtoos1.0; KS X ISO/IEC 14568:2009 10 End_Profile; Ide

23、ntification Identifier is ; Title : Word count program; Module : int word_count(char ); Input : File name; Output : Number of word; Function : Count the number of word in the input file; Constraints : Only English words can be counted; Revision : 06/05/95 H.T; Design : 05/30/95 H.N; End_Identificati

24、on; - This is a sample chart - for experimental descriptions. Module_Algorithm begin begin imperative Open the file; imperative Initialize the word-counter; end; loop imperative Read one record; if End-of-file then terminate block ; end_if; loop begin loop exclusive select if Alphabetical Character

25、then terminate block ; else_if Other character then imperative null ; else_if End-of-reco rd then terminate block ; end_exclusive_select; end_loop; loop exclusive_select if Alphabetical Character then imperative null ; else_if Other character then terminate block ; else_if End-of-reco rd then termin

26、ate block ; KS X ISO/IEC 14568:2009 11 end_exclusive_select; end_loop ; end ; imperative Add 1 to the value of the word-counter; end_loop; end_loop; begin imperative Close the file; end; end; End_Module_Algorithm; End_M_Packet; KS X ISO/IEC 14568:2009 12 B () DXL KS X 2210 B.1 Imperative Construct o

27、f KS X 2210 includes： := imperative ; := := I I := “null“ := “call“ := := “goto“ := “abstract“ := := := | | | B.2 Serial Construct of KS X 2210 includes： := begin end ; B.3 Parallel Construct of KS X 2210 includes： := parallel end_parallel ; B.4 Iterative Construct of KS X 2210 includes： := | | : =

28、condition loop end_loop ; : = loop end_loop condition ; := loop end_loop ; := := “while“ | “until“ | “for“ := “while“ | “until“ B.5 Selective Choice Construct of KS X 2210 includes： KS X ISO/IEC 14568:2009 13 := | | := if then end_if ; := | := exclusive_select if then else_if then else end_exclusive

29、_select ; := exclusive_select case when : end exclusive select ; := := : = inclusive_select case when ; end_inclusive_select ; B.6 Termination of KS X 2210 includes： := terminate ; := system | module | block KS X ISO/IEC 14568:2009 14 C () DXL () DXL CASE . ISO/IEC JTC1/SC7/WG11 . ISO/IEC JTC1/SC7/W

30、G11 , . 7.19 “ ”(Diagrams for Software Development) ：1. , , , 2. , 3. ISO , , , ：7.19.2 7.19.2.1 7.19.2.2 7.19.3 Petri-net 7.28 “ ”(Software Engineering Data Description and Interchange SEDDI) ：1. , , , ：7.28.1 7.28.2 7.28.3 7.28.4 PCTE 7.28.5 IRDS DXL 7.19.2.1 , 7.28.2 7.19.2 , . KS X ISO/IEC 14568

31、:2009 15 KS X ISO/IEC 14568:2009 1 DXL . DXL CASE . 2 KS . 3 DXL KS X 2210 , KS X ISO 5807 , . 4 DXL , DXL ( A), DXL KS X 2210 ( B), DXL ( C) . 5 , . (DXL) 153787 1 92 3(13) (02)26240114 (02)262401489 http:/ KS X ISO/IEC 14568 :2009 KSKSKS SKSKS KSKS SKS KS SKS KSKS SKSKS KSKSKS Information technology DXL ： Diagram eXchange Language for tree-structured charts ICS 35.060 Korean Agency for Technology and Standards h