Search results
Results From The WOW.Com Content Network
I created a string of alphanumerics such that their placement in the string describes their Morse code representation. Originally I was going to use binary, but 01 would be the same as 1. So I used ternary with - = 1 and . = 2. Thus is character c is at index 1121 in this string, its Morse code representation is --.-.
Because Morse code is a variable-length code that uses between 1 and 4 symbols for each letter, the tables 31313855 (bit 1) and 60257815 (bit 0) can together represent one less than the length of each letter's code.
The string literal is Morse code setup as a binary heap in array form. VB.NET lets you index strings as arrays of characters. The \ is integer division, taking the left sub heap for 1 or the right sub heap for 111. I used ! as a blank for when there isn't a value in that heap spot. It's only necessary to properly pad out the indices.
Otherwise we check each word w in the dictionary d, translate it into morse code C and, if the remaining code i starts with C, we add the word w to the translated beginning b and call the function s recursively on the remainder.
Spaces replacing the first three pieces, the Morse code with a -suffix, the second half of the remaining letters; The new lines follow the same format as the existing line, just with an extra Morse prefix and half as many letters remaining to process. This is then repeated until each line has only one letter. _ [single space]
Then the following code. XX... X..X. X..XX X..XX X.XX. translates to 4a b4 66 03 56 4b bf d2 6e fd c3 2c 70 in hex, or J´f VK¿ÒnýÃ,p as a string. Note that the resulting string will very likely have ASCII unprintables. Task. Translate the given Nightmare Puzzlang code into a string. Input & output
All the Morse codes for the letters in this set end with .. [AJKMOQT-Y] $&- All the Morse codes for the letters in this set end with -. T`L`\EDKN_UMS\EWNRTTMWGAI_ISADKG Replace each letter with the letter whose Morse code is the prefix of that letter (here E and T are simply deleted via the unescaped _, but normally they would be turned into ...
A string is dot-heavy when its morse representation contains more dots than dashes. For example, the letter E is a single dot, which means it is Dot-heavy. Input The input string will only contain
Define the tradfn R, taking left argument D (dictionary word list) and right argument i (the input, i.e. the song in undelimited Morse code), and having local variables C (word choice array), M (dictionary translated to Morse code), and w (array listing the indices into the dictionary of what the current word could be).
The code works in two phases: First, it replaces each run of 5 binary digits with the corresponding two characters (letter and figure) from a lookup table. The lookup table is in the format 𝟎𝟎𝟎𝟎𝟎𝐋𝐅𝟎𝟎𝟎𝟎𝟎𝐋𝐅… where 𝟎 is a binary digit and 𝐋 and 𝐅 are the corresponding letter and figure ...