4lex1v

for i:=1 to 15 do
	begin
		if data[i, 7] <> '*' then
			begin
				count:= 1;
				for j:=i+1 to 15 do
					begin
						equals:= true;
						for h:=8 to 20 do
							if data[i,h] <> data[j,h] then

4lex1v

program var_2;
type
	row = array[1..15] of string;
var
	data: row;
	i, j: byte;
	firstString: string;
	secondString: string;
	count: integer;

4lex1v

program prog;
type

	job_entry = record
		job: string;
		count: integer;
	end;
	table = array[1..15] of job_entry;
var
	jobs: table;

4lex1v

{Модуль}

unit myUnit; 
interface
	type
		job_entry = record
			job: string;
			count: integer;
		end;
	table = array[1..16] of job_entry;

4lex1v

package recfun
import common._

object Main {
  def main(args: Array[String]) {
    println("Pascal's Triangle")
    for (row <- 0 to 10) {
      for (col <- 0 to row)
        print(pascal(col, row) + " ")
      println()

4lex1v

{модуль}
unit LinkedList;
interface
	type
		pt =^ elem;
		elem = record
			job: string;
			count: integer;
			next: pt;
		end;

4lex1v

{модуль}

unit LinkedList;
interface
	type
		pt =^ elem;
		elem = record
			line: string;
			index: integer;
			prev: pt;

4lex1v

unit LinkedList;
interface
	type
		pt =^ elem;
		elem = record
			entry: string;
			count: integer;
			next: pt;
		end;
		llist = pt;

4lex1v

unit LinkedList;
interface
  type
    node =^ elem;
    elem = record
      entry : string;
      count : integer;
      next  : node;
    end;
    llist = node;

4lex1v

_DATA SEGMENT
TriTable \
   BYTE 64
   BYTE 45,63
   BYTE 75,09,91
...et cetera
_DATA ENDS
   mov ebx, 0FFFFFFh ; path ;)
   xor ebp, ebp ; max total
next:	mov ecx, ebx