Просмотр кода страницы Fragment of flow graph

'''Fragment of flow graph''' --- [[Фрагмент уграфа|''фрагмент уграфа'']].

A subgraph of a ''control flow graph'' <math>G</math> is called a '''fragment'''.

A fragment <math>A</math> is a '''subfragment''' of <math>B</math>, if <math>A\subseteq B</math>; it is a
'''proper subfragment''' if <math>A\neq B</math>.

A node <math>p</math> of a fragment <math>A</math> is called '''initial''' (respectively, '''output''' or '''exit''')
if either <math>p</math> is the initial node of <math>G</math> (respectively, <math>p</math> is the terminal node of <math>G</math>)
or an arc of <math>G</math> not belonging to <math>A</math> enters <math>p</math> ( respectively, leaves <math>P</math>).

A node <math>p</math> of a fragment <math>A</math> is called its '''entry ''' if there is a part from the initial node of <math>G</math> to <math>p</math>
that includes no arcs of the fragment <math>A</math>. <math>p</math> is called a '''terminal''' node of a fragment <math>A</math>
if <math>p</math> does not belong to <math>A</math> and is a successor of a node of <math>A</math>.

A node <math>p</math> of a fragment <math>A</math> other than the initial and terminal nodes of <math>G</math>
is called a boundary of <math>A</math> if <math>p</math> is the initial or output node of <math>A</math>.

Let <math>p</math> be a '''boundary''' node of a fragment <math>A</math>. It is called '''starting '''
of <math>A</math> if <math>A</math> contains no predecessors of <math>p</math>  or all successors of <math>p</math>. It is called
'''finishing'''of <math>A</math> if <math>A</math> contains all predecessors of <math>p</math> or no successors of <math>p</math>.


[[Категория: Потоковый анализ программ]]