Numerical and alphabetical suffixes: Difference between revisions

=={{header|Factor}}==

===Functional===

grouping grouping.extras kernel literals math math.functions

math.parser math.ranges qw regexp sequences sequences.deep

] each ;

 

{{out}}

<pre>

===EBNF===

This solution uses Factor's extended Backus-Naur form (EBNF) language to define a grammar for parsing numerical/alphabetical suffix numbers. The goal was to describe as much of the suffix-number as possible in a declarative manner, minimizing the use of actions (Factor code that is run on a rule before being added to the abstract syntax tree) and helper functions. The biggest departure from this goal was to parse the metric/binary suffixes based on their index in a collection, as this method is less verbose than defining a rule for each suffix.

math.functions math.parser math.ranges multiline peg.ebnf

quotations qw sequences sequences.deep splitting strings unicode ;

] each ;

{{out}}

<pre>

 

=={{header|Go}}==

 

import (

"9!!!!!!!", "9!!!!!!!!", "9!!!!!!!!!"}

process(numbers)

 

{{out}}

 

=={{header|Julia}}==

 

partialsuffixes = Dict("PAIR" => "PAIRS", "SCO" => "SCORES", "DOZ" => "DOZENS",

 

testsuffixes()

<pre>

Testing: ["2greatGRo", "24Gros", "288Doz", "1,728pairs", "172.8SCOre"]

 

=={{header|Nim}}==

const input = """

2greatGRo 24Gros 288Doz 1,728pairs 172.8SCOre

output &= sepFloat(res)&" "

echo(output)

{{out}}<pre>

Input:

 

=={{header|Perl}}==

 

use strict; # https://rosettacode.org/wiki/Numerical_and_alphabetical_suffixes

25.123kiKI 25.123Mi 2.5123e-00002Gi +.25123E-7Ei

-.25123e-34Vikki 2e-77gooGols

{{out}}

<pre>

Using bigatom to get the full precision needed for the tests (esp the "Vikki" one).<br>

Note that comma-insertion was added to ba_sprintf() in version 0.8.0.

{{out}}

<pre>

=={{header|Python}}==

{{works with|CPython|3.7.3}}

from functools import reduce

from operator import mul

print("Input:", ' '.join(test_cases))

print("Output:", ' '.join(format(result, ',f').strip('0').strip('.') for result in map(expand, test_cases)))

{{out}}

<pre>

Note: I am blatantly and deliberately ignoring the task guidelines for formatting the output. It has no bearing on the core of the task. If you really, ''really'','' '''REALLY''' ''want to see badly formatted output, uncomment the last line.

 

 

my $googol = 10**100;

 

# Task required stupid layout

{{out}}

<pre> 2greatGRo: 3,456

 

=={{header|REXX}}==

numeric digits 2000 /*allow the usage of ginormous numbers.*/

@.=; @.1= '2greatGRo 24Gros 288Doz 1,728pairs 172.8SCOre'

if \isNum(x) then x= $sfx!(x); if isNum(x) then return x/1

if q==1 then return x

{{out|output|text=&nbsp; when using the default inputs:}}

<pre>

{{libheader|Wren-str}}

{{libheader|Wren-fmt}}

 

var abbrevs = {

 

numbers = ["9!", "9!!", "9!!!", "9!!!!", "9!!!!!", "9!!!!!!", "9!!!!!!!", "9!!!!!!!!", "9!!!!!!!!!"]

 

{{out}}

Floats are limited to 64 bit IEEE754.

Error checking is nonexistent.

var kRE,kD, aRE,aD;

 

re=RegExp("(%s)".fmt(re.close().strip().replace(" ","|")));

return(re,abrevs);

"1,567", "+1.567k", "0.1567e-2m",

"25.123kK", "25.123m", "2.5123e-00002G",

if((r:=naSuffixes(na)).isType(Float)) println("%16s : %,f".fmt(na,r));

else println("%16s : %,d".fmt(na,r));

{{out}}

<pre style="height:45ex">