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

Published on 12 May 2024 09:40 PM
#Action!

How to resolve the algorithm Bitwise operations step by step in the Action! 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 Action! programming language

Source code in the action! programming language

BYTE FUNC Not(BYTE a)
RETURN (a!$FF)

PROC Main()
  BYTE a=[127],b=[2],res

  res=a&b
  PrintF("%B AND %B = %B%E",a,b,res)
  
  res=a%b
  PrintF("%B OR %B = %B%E",a,b,res)

  res=a!b
  PrintF("%B XOR %B = %B%E",a,b,res)

  res=Not(a)
  PrintF("NOT %B = %B (by %B XOR $FF)%E",a,res,a)

  res=a RSH b
  PrintF("%B SHR %B = %B%E",a,b,res)

  res=a LSH b
  PrintF("%B SHL %B = %B%E",a,b,res)
RETURN

You may also check:How to resolve the algorithm 24 game/Solve step by step in the Haskell programming language
You may also check:How to resolve the algorithm Four bit adder step by step in the Forth programming language
You may also check:How to resolve the algorithm Long multiplication step by step in the jq programming language
You may also check:How to resolve the algorithm Longest common substring step by step in the AppleScript programming language
You may also check:How to resolve the algorithm Monads/Maybe monad step by step in the C# programming language