txt2bf

Gesponsorde koppelingen

PHP script bestanden

  1. txt2bf

« Lees de omschrijving en reacties

#!/usr/bin/php

Code (php)
PHP script in nieuw venster Selecteer het PHP script
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
<?php
/*
txt2bf.phpcli - a simple ASCII to brainfuck converter in PHP
Copyright (C) 2006 JRRZZ.net

This program is free software; you can redistribute it and/or
modify it under the terms of the GNU General Public License
as published by the Free Software Foundation; either version 2
of the License, or (at your option) any later version.

This program is distributed in the hope that it will be useful,
but WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
GNU General Public License for more details.

You should have received a copy of the GNU General Public License
along with this program; if not, write to the Free Software
Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA  02110-1301, USA.
*/

/*
Version: 0.5 - 2006/03/08 23:12
Tested with the bff interpreter (http://swapped.cc/bf/) and PHP 4.4.2
*/

//does it have to be binary safe (keep NULL characters)?
//warning: it will result in substantially larger brainfucks

$binarysafe = false;

function
printchar($char, $int) { //print out char for int long
  $i = 0;
  while ($i < $int) {
    $return .= $char;
    $i++;
  }

  return $return;
}

function
searchmem ($x, $s, $cptr) { //search in x for the closest value for s closest to the current ptr and return new ptr
  $i = 0;
  while ($i < count($x)) {
    $dis = $i - $cptr; //get the distance to the ptr
    if ($dis < 0) $dis *= -1; //invert if negative
    $div = $x[$i]-$s;
    if ($div < 0) $div *= -1; //invert if negative
    $div += $dis; //compensate for ptr shifting
    if ($i == 0) {
      $lowestdiv = $div;
      $ptr = 0;
    }
else if ($div < $lowestdiv) {
      $ptr = $i;
      $lowestdiv = $div;
    }

    $i++;
  }

  return $ptr;
}

function
ascii2bf($index, $decrementer) { //convert char array index to string brainfuck using int decrementer
  $out = printchar('+', $decrementer); //initial loop decrementer
  $i = 0;
  $muls = array();
  while ($i < count($index)) { //get best possible multipliers in one array
    $div = $index[$i]/$decrementer;
    $mod = fmod($index[$i], $decrementer);
    if ($mod <= 5) {
      $mul = floor($div);
    }
else {
      $mul = floor($div)+1;
    }

    if (!in_array($mul, $muls)) $muls[] = $mul;
    $i++;
  }

  $i = 0;
  $x = array(); //this is our memory page
  $ptr = 0; //this is our pointer
  $x[$ptr] = 0; //after the loop it's decremented to 0
  $out .= '['; //create prefill loop
  while ($i < count($muls)) {
    $out .= '>'.printchar('+', $muls[$i]);
    $x[$i+1] = $muls[$i]*$decrementer; //put the values in memory
    $i++;
  }

  $out .= printchar('<', count($muls)).'-]'; //end of prefill loop
  $i = 0;
  while ($i < count($index)) {
    $loc = searchmem($x, $index[$i], $ptr);//get the closest value in memory
    if ($loc < $ptr) { //where do we go to?
      $dir = '<';
    }
else {
      $dir = '>';
    }

    $dirdiv = $ptr-$loc; //how long? if 0 we stay
    if ($dirdiv < 0) $dirdiv *= -1; //invert if negative
    $out .= printchar($dir, $dirdiv);
    $ptr = $loc; //we have moved
    $offset = $index[$i] - $x[$ptr]; //get the offset, of 0 we don't do anything
    if ($offset > 0) { //and the direction
      $offdir = '+';
    }
else {
      $offdir = '-';
    }

    $x[$ptr] = $index[$i]; //sync memory
    if ($offset < 0) $offset *= -1; //invert if negative
    $out .= printchar($offdir, $offset).'.'; //print out our char
    $i++;
  }

  return $out;
}


if ($argc != 2) {
  echo "Usage: ".$argv[0]." textfile\n";
  exit;
}

$file = @fopen($argv[1], 'r');
if (!$file) {
  echo "Could not read file: ".$argv[1]."\n";
  exit;
}

$txt = "";
while(!feof($file)) $txt .= fread($file, 1);
fclose($file);
$txt = preg_split('//', $txt); //get char array
$i = 0;
$smallest = 256; //max ASCII value + 1
$index = array();
while ($i < count($txt)) {
  if ($binarysafe) {
    $ascii = ord($txt[$i]);
    $index[] = $ascii; //put the ASCII values in an array
    if ($ascii < $smallest && $ascii > 0) $smallest = $ascii; //get the smallest ASCII value
  } else {
    if (ord($txt[$i]) != 0) { //filter out NULL characters (making it binary un-safe)
      $ascii = ord($txt[$i]);
      $index[] = $ascii; //put the ASCII values in an array
      if ($ascii < $smallest && $ascii > 0) $smallest = $ascii; //get the smallest ASCII value that is not zero
    }
  }

  $i++;
}

$dec = $smallest;
while ($dec > 0) {
  $bf = ascii2bf($index, $dec);
  if (($dec == $smallest) || (strlen($bf) < strlen($bff))) $bff = $bf; //use all the decrementers and get the shortest result (usually highest decrementer though)
  $dec--;
}

echo $bff."\n";
?>

 
 

Om de gebruiksvriendelijkheid van onze website en diensten te optimaliseren maken wij gebruik van cookies. Deze cookies gebruiken wij voor functionaliteiten, analytische gegevens en marketing doeleinden. U vindt meer informatie in onze privacy statement.