ASCII art diagram converter: Difference between revisions

=={{header|AArch64 Assembly}}==

{{works with|as|Raspberry Pi 3B version Buster 64 bits <br> or android 64 bits with application Termux }}

/* ARM assembly AARCH64 Raspberry PI 3B or android 64 bits */

/* program asciiDiagram64.s */

=={{header|ARM Assembly}}==

{{works with|as|Raspberry Pi <br> or android 32 bits with application Termux}}

/* ARM assembly Raspberry PI or android 32 bits */

/* program asciiDiagram.s */

=={{header|C}}==

interpret text diagram as data structure

#include <stdlib.h>

#include <stdio.h>

The ASCII diagram is parsed at compile time into a data structure that is used at runtime to encode and decode the fields.

 

#include <bitset>

#include <iostream>

 

An invalid table will cause a compilation error - here the ANCOUNT field is missing.

+--+--+--+--+--+--+--+--+--+--+--+--+--+--+--+--+

| ID |

=={{header|D}}==

This solution generates anonymous struct code at compile-time, that can be mixed-in inside a struct or class.

import std.conv: text;

import std.format: format;

 

=={{header|Go}}==

 

import (

===Variant based on parsing===

 

import Control.Monad (guard)

 

===List-based interpretation with validation===

 

import Data.List.Split (splitOn)

import Control.Monad (unless)

=={{header|J}}==

 

 

soul=: -. {.

Sample definition (note the deliberate introduction of extraneous whitespace in locations the task requires us to ignore it.

 

+--+--+--+--+--+--+--+--+--+--+--+--+--+--+--+--+

| ID |

Example data for sample definition:

 

4095 13 5 6144 4096 'ID Opcode RCODE ARCOUNT QDCOUNT' set start

4095 0 13 0 0 0 0 0 5 4096 0 0 6144

Separate methods to validate, display, decode ASCII art, and decode hex value.

 

import java.math.BigInteger;

import java.util.ArrayList;

 

=={{header|JavaScript}}==

const trimWhitespace = s => s.trim();

const isNotEmpty = s => s !== '';

=={{header|Julia}}==

The validator() function can be customized. The one used only checks length.

+--+--+--+--+--+--+--+--+--+--+--+--+--+--+--+--+

| ID |

=={{header|Lua}}==

Provided mainly to illustrate the string-parsing aspect, not necessarily the bit-structure aspect...

local lines = {}

for s in diagram:gmatch("[^\r\n]+") do

Of course, the second mechanism may be used for all cases. The first mechanism is mainly interesting to show how it is possible, using Nim powerful macro system, to create a type ''ex nihilo''.

 

import strutils

import tables

 

=={{header|Ol}}==

(import (owl parse))

 

 

=={{header|Perl}}==

 

use strict;

=={{header|Phix}}==

Should work on any width, but didn't actually test, or verify width is 8/16/32/64.

<span style="color: #008080;">function</span> <span style="color: #000000;">interpret</span><span style="color: #0000FF;">(</span><span style="color: #004080;">sequence</span> <span style="color: #000000;">lines</span><span style="color: #0000FF;">)</span>

<span style="color: #008080;">if</span> <span style="color: #7060A8;">remainder</span><span style="color: #0000FF;">(</span><span style="color: #7060A8;">length</span><span style="color: #0000FF;">(</span><span style="color: #000000;">lines</span><span style="color: #0000FF;">),</span><span style="color: #000000;">2</span><span style="color: #0000FF;">)!=</span><span style="color: #000000;">1</span> <span style="color: #008080;">then</span>

 

=={{header|Python}}==

"""

http://rosettacode.org/wiki/ASCII_art_diagram_converter

<b><code>ascii-art-parser.rkt</code></b>

Note that this is in the <code>racket/base</code> language so it doesn't overburden the modules that import it, especially since they're at the suntax phase.

(require (only-in racket/list drop-right)

(only-in racket/string string-trim))

 

<b><code>ascii-art-reader.rkt</code></b>

(require (for-syntax "ascii-art-parser.rkt"))

(require (for-syntax racket/syntax))

 

<b><code>test-ascii-art-reader.rkt</code></b>

(require "ascii-art-reader.rkt")

(require "ascii-art-parser.rkt")

{{works with|Rakudo|2018.05}}

 

rule TOP { <.line-separator> [<line> <.line-separator>]+ }

rule line-separator { <.ws> '+--'+ '+' }

=={{header|REXX}}==

Some code was added to the REXX program to validate the input file.

numeric digits 100 /*be able to handle large numbers. */

er= '***error*** illegal input txt' /*a literal used for error messages. */

 

=={{header|Ruby}}==

+--+--+--+--+--+--+--+--+--+--+--+--+--+--+--+--+

| ID |

See the output below the source code.

 

 

pub type Bit = bool;

 

In this implementation, '''parse''' produces a dictionary from names to bit-lengths. '''encode''' and '''decode''' use these to produce appropriate binary format strings, and then do what they say on the tin. As implemented, this is limited to unsigned numeric values in fields. Supporting unsigned values, strings and enums would require parsing a more complex annotation than only the ASCII art packet structure, but ought not take much more code.

namespace eval asciipacket {

proc assert {expr} { ;# for "static" assertions that throw nice errors

</syntaxhighlight>

And here is how to use it with the original test data:

proc test {} {

set header {

=={{header|Vlang}}==

{{trans|go}}

import strings

 

{{libheader|Wren-fmt}}

{{libheader|Wren-big}}

import "/fmt" for Fmt

import "/big" for BigInt