How to resolve the algorithm Move-to-front algorithm step by step in the Bracmat programming language

Published on 12 May 2024 09:40 PM
#Bracmat

How to resolve the algorithm Move-to-front algorithm step by step in the Bracmat programming language

Table of Contents

Problem Statement

Given a symbol table of a zero-indexed array of all possible input symbols this algorithm reversibly transforms a sequence of input symbols into an array of output numbers (indices). The transform in many cases acts to give frequently repeated input symbols lower indices which is useful in some compression algorithms.

Encoding the string of character symbols 'broood' using a symbol table of the lowercase characters   a-to-z

Decoding the indices back to the original symbol order:

The strings are:

(Note the misspellings in the above strings.)

Let's start with the solution:

Step by Step solution about How to resolve the algorithm Move-to-front algorithm step by step in the Bracmat programming language

Source code in the bracmat programming language

  ( encode
  =   string symboltable
    .   !arg:(?string.?symboltable)
      &   vap
        $ ( ( 
            =   A Z i
              .   !symboltable:?A [?i !arg ?Z
                & !arg !A !Z:?symboltable
                & !i
            )
          . !string
          )
  )
& ( decode
  =   indices symboltable
    .   !arg:(?indices.?symboltable)
      &   str
        $ ( map
          $ ( ( 
              =   A Z symbol
                .   !symboltable:?A [!arg %?symbol ?Z
                  & !symbol !A !Z:?symboltable
                  & !symbol
              )
            . !indices
            )
          )
  )
& ( test
  =   string symboltable encoded decoded
    .   !arg:(?string.?symboltable)
      & put$str$("input:" !string ", ")
      & encode$(!string.!symboltable):?encoded
      & put$("encoded:" !encoded ", ")
      & decode$(!encoded.!symboltable):?decoded
      & put$str$("decoded:" !decoded ", ")
      & (   !string:!decoded
          & out$OK
        | out$WRONG
        )
  )
&   a b c d e f g h i j k l m n o p q r s t y v w x y z
  : ?symboltable
& test$(broood.!symboltable)
& test$(bananaaa.!symboltable)
& test$(hiphophiphop.!symboltable)

You may also check:How to resolve the algorithm Hello world/Graphical step by step in the Nemerle programming language
You may also check:How to resolve the algorithm Leap year step by step in the Smalltalk programming language
You may also check:How to resolve the algorithm Determine if a string is numeric step by step in the Lisaac programming language
You may also check:How to resolve the algorithm Sort an integer array step by step in the Swift programming language
You may also check:How to resolve the algorithm Respond to an unknown method call step by step in the J programming language