How to resolve the algorithm Determine if a string is collapsible step by step in the Miranda programming language

Published on 12 May 2024 09:40 PM

How to resolve the algorithm Determine if a string is collapsible step by step in the Miranda programming language

Table of Contents

Problem Statement

Determine if a character string is   collapsible. And if so,   collapse the string   (by removing   immediately repeated   characters).

If a character string has   immediately repeated   character(s),   the repeated characters are to be deleted (removed),   but not the primary (1st) character(s).

An   immediately repeated   character is any character that is   immediately   followed by an identical character (or characters).   Another word choice could've been   duplicated character,   but that might have ruled out   (to some readers)   triplicated characters   ···   or more.

{This Rosetta Code task was inspired by a newly introduced   (as of around November 2019)   PL/I   BIF:   collapse.}

In the following character string:

Only the 2nd   t,   e, and   l   are repeated characters,   indicated by underscores (above),   even though they (those characters) appear elsewhere in the character string.

So, after collapsing the string, the result would be:

Another example: In the following character string:

The "collapsed" string would be:

Write a subroutine/function/procedure/routine···   to locate   repeated   characters and   collapse   (delete)   them from the character string.   The character string can be processed from either direction.

Show all output here, on this page:

Use (at least) the following five strings,   all strings are length seventy-two (characters, including blanks),   except the 1st string:

Let's start with the solution:

Step by Step solution about How to resolve the algorithm Determine if a string is collapsible step by step in the Miranda programming language

Source code in the miranda programming language

main :: [sys_message]
main = [Stdout (lay (map test tests))]

tests :: [[char]]
tests
= [
  "",
  "\"If I were two-faced, would I be wearing this one?\" --- Abraham Lincoln ",
  "..1111111111111111111111111111111111111111111111111111111111111111111788",
  "I never give 'em hell, I just tell the truth, and they think it's hell. ",
  "                                                     --- Harry S Truman "
  ]

test :: [char]->[char]
test s = lay [before, after]
         where before = disp s
               after  = disp (collapse s)

disp :: [char]->[char]
disp s = show (#s) ++ ": <<<" ++ s ++ ">>>"

collapse :: [*]->[*]
collapse []       = []
collapse [x]      = [x]
collapse (x:y:xs) = collapse (y:xs),   if x=y
                  = x:collapse (y:xs), otherwise

  

You may also check:How to resolve the algorithm 100 doors step by step in the CLIPS programming language
You may also check:How to resolve the algorithm Cholesky decomposition step by step in the OCaml programming language
You may also check:How to resolve the algorithm Menu step by step in the Racket programming language
You may also check:How to resolve the algorithm Sorting algorithms/Merge sort step by step in the Python programming language
You may also check:How to resolve the algorithm Greyscale bars/Display step by step in the Frink programming language