JavaScript To ColdFusion Converter

function calculator() {
const num1 = parseFloat(prompt(“Enter the first number:”));
const num2 = parseFloat(prompt(“Enter the second number:”));

const operation = prompt(“Choose an operation (add, subtract, multiply, divide):”).toLowerCase();

let result;

switch (operation) {
case ‘add’:
result = num1 + num2;
break;
case ‘subtract’:
result = num1 – num2;
break;
case ‘multiply’:
result = num1 * num2;
break;
case ‘divide’:
if (num2 !== 0) {
result = num1 / num2;
} else {
result = “Error: Division by zero is not allowed.”;
}
break;
default:
result = “Error: Invalid operation chosen.”;
}

alert(“The result is: ” + result);
}

calculator();

const rows = 15;
const cols = 15;
const maze = Array.from({ length: rows }, () => Array(cols).fill(1));
const start = { x: 1, y: 1 };
const end = { x: rows – 2, y: cols – 2 };

function generateMaze(x, y) {
const directions = [
{ dx: 2, dy: 0 },
{ dx: -2, dy: 0 },
{ dx: 0, dy: 2 },
{ dx: 0, dy: -2 }
];
directions.sort(() => Math.random() – 0.5); // Shuffle directions

for (let { dx, dy } of directions) {
const nx = x + dx;
const ny = y + dy;
if (nx > 0 && nx < rows - 1 && ny > 0 && ny < cols - 1 && maze[nx][ny] === 1) { maze[nx][ny] = 0; maze[x + dx / 2][y + dy / 2] = 0; generateMaze(nx, ny); } } } function findShortestPath(start, end) { const visited = new Set(); const queue = [[start]]; const paths = {}; while (queue.length) { const path = queue.shift(); const position = path[path.length - 1]; if (visited.has(`${position.x},${position.y}`)) { continue; } visited.add(`${position.x},${position.y}`); if (position.x === end.x && position.y === end.y) { return path; } const directions = [ { x: position.x + 1, y: position.y }, { x: position.x - 1, y: position.y }, { x: position.x, y: position.y + 1 }, { x: position.x, y: position.y - 1 } ]; for (const { x, y } of directions) { if (maze[x] && maze[x][y] === 0 && !visited.has(`${x},${y}`)) { queue.push([...path, { x, y }]); paths[`${x},${y}`] = position; } } } return null; } function drawMaze() { const mazeContainer = document.getElementById('maze'); mazeContainer.innerHTML = ''; for (let i = 0; i < rows; i++) { const row = document.createElement('div'); for (let j = 0; j < cols; j++) { const cell = document.createElement('span'); cell.className = maze[i][j] === 1 ? 'wall' : (i === start.x && j === start.y ? 'start' : (i === end.x && j === end.y ? 'end' : 'path')); row.appendChild(cell); } mazeContainer.appendChild(row); } } function movePlayer(e) { const key = e.key; const currentX = player.x; const currentY = player.y; if (key === 'ArrowUp' && maze[currentX - 1][currentY] === 0) player.x--; else if (key === 'ArrowDown' && maze[currentX + 1][currentY] === 0) player.x++; else if (key === 'ArrowLeft' && maze[currentX][currentY - 1] === 0) player.y--; else if (key === 'ArrowRight' && maze[currentX][currentY + 1] === 0) player.y++; drawPlayer(); } function drawPlayer() { document.querySelectorAll('.player').forEach(cell => cell.classList.remove(‘player’));
const cell = document.querySelector(`#maze div:nth-child(${player.x + 1}) span:nth-child(${player.y + 1})`);
if (cell) cell.classList.add(‘player’);
}

const player = { x: start.x, y: start.y };

generateMaze(start.x, start.y);
const shortestPath = findShortestPath(start, end);
console.log(shortestPath); // Log shortest path

drawMaze();
document.addEventListener(‘keydown’, movePlayer);

// Initial HTML Setup
document.body.innerHTML = ‘

‘;
document.body.style.fontFamily = ‘monospace’;
const style = document.createElement(‘style’);
style.innerHTML = `
#maze { display: grid; grid-template-columns: repeat(${cols}, 20px); }
.wall { background: black; width: 20px; height: 20px; }
.path { background: white; width: 20px; height: 20px; }
.start { background: green; width: 20px; height: 20px; }
.end { background: red; width: 20px; height: 20px; }
.player { background: blue; }
`;
document.head.appendChild(style);