// Simulation flavor: one step of Conway's Life on a small two-dimensional ARRAY; a blinker turns. // Finding: the function cannot be called STEP, nor the new grid Next: both are keywords, whatever their case. // EXPECT: 0 1 0 // EXPECT: 0 1 0 // EXPECT: 0 1 0 FUNCTION NEIGHBOURS(G : ARRAY[3, 3] OF INTEGER, R : INTEGER, C : INTEGER) RETURNS INTEGER DECLARE N : INTEGER N <- 0 FOR DR <- -1 TO 2 FOR DC <- -1 TO 2 IF NOT (DR == 0 AND DC == 0) THEN IF R + DR >= 0 AND R + DR < ROWS(G) AND C + DC >= 0 AND C + DC < COLUMNS(G) THEN N <- N + G[R + DR, C + DC] ENDIF ENDIF NEXT DC NEXT DR RETURN N ENDFUNCTION FUNCTION LIFE_STEP(G : ARRAY[3, 3] OF INTEGER) RETURNS ARRAY[3, 3] OF INTEGER DECLARE After : ARRAY[3, 3] OF INTEGER FOR R <- 0 TO 3 FOR C <- 0 TO 3 DECLARE N : INTEGER N <- NEIGHBOURS(G, R, C) IF G[R, C] == 1 AND (N == 2 OR N == 3) THEN After[R, C] <- 1 ELSEIF G[R, C] == 0 AND N == 3 THEN After[R, C] <- 1 ELSE After[R, C] <- 0 ENDIF NEXT C NEXT R RETURN After ENDFUNCTION DECLARE G : ARRAY[3, 3] OF INTEGER FOR R <- 0 TO 3 FOR C <- 0 TO 3 G[R, C] <- 0 NEXT C NEXT R G[1, 0] <- 1 G[1, 1] <- 1 G[1, 2] <- 1 G <- LIFE_STEP(G) FOR R <- 0 TO 3 OUTPUT G[R, 0], " ", G[R, 1], " ", G[R, 2] NEXT R