How to resolve the algorithm Bitwise operations step by step in the Forth programming language

Published on 12 May 2024 09:40 PM
#Forth

How to resolve the algorithm Bitwise operations step by step in the Forth programming language

Table of Contents

Problem Statement

Write a routine to perform a bitwise AND, OR, and XOR on two integers, a bitwise NOT on the first integer, a left shift, right shift, right arithmetic shift, left rotate, and right rotate. All shifts and rotates should be done on the first integer with a shift/rotate amount of the second integer. If any operation is not available in your language, note it.

Let's start with the solution:

Step by Step solution about How to resolve the algorithm Bitwise operations step by step in the Forth programming language

Source code in the forth programming language

: arshift 0 ?do 2/ loop ;            \ 2/ is an arithmetic shift right by one bit (2* shifts left one bit)
: bitwise ( a b -- )
  cr ." a = " over . ." b = " dup .
  cr ." a and b = " 2dup and .
  cr ." a  or b = " 2dup  or .
  cr ." a xor b = " 2dup xor .
  cr ." not a = " over invert . 
  cr ." a shl b = " 2dup lshift .
  cr ." a shr b = " 2dup rshift .
  cr ." a ashr b = " 2dup arshift .
  2drop ;

You may also check:How to resolve the algorithm Caesar cipher step by step in the OCaml programming language
You may also check:How to resolve the algorithm Abbreviations, automatic step by step in the TSE SAL programming language
You may also check:How to resolve the algorithm Fibonacci sequence step by step in the Swift programming language
You may also check:How to resolve the algorithm Cheryl's birthday step by step in the Ruby programming language
You may also check:How to resolve the algorithm Roman numerals/Encode step by step in the BASIC programming language