Tokenize a string: Difference between revisions

{{trans|Python}}

 

V tokens = text.split(‘,’)

 

{{out}}

 

=={{header|360 Assembly}}==

TOKSTR CSECT

USING TOKSTR,R13 base register

PG DC CL80' ' buffer

YREGS

{{out}}

<pre>

 

=={{header|8080 Assembly}}==

org 100h

jmp demo

period: db '. $'

hello: db 'Hello,How,Are,You,Today$'

{{out}}

<pre>Hello. How. Are. You. Today.</pre>

=={{header|8086 Assembly}}==

org 100h

section .text

hello: db 'Hello,How,Are,You,Today$'

section .bss

{{out}}

<pre>Hello. How. Are. You. Today. </pre>

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

{{works with|as|Raspberry Pi 3B version Buster 64 bits}}

/* ARM assembly AARCH64 Raspberry PI 3B */

/* program strTokenize64.s */

/* for this file see task include a file in language AArch64 assembly */

.include "../includeARM64.inc"

{{Output}}

<pre>

 

=={{header|ACL2}}==

(if (or (endp xs) (eql (first xs) delim))

(mv nil (rest xs))

(progn$ (cw (first strs))

(cw (coerce (list delim) 'string))

 

{{out}}

<pre>&gt; (print-with (split-str "Hello,How,Are,You,Today" #\,) #\.)

Hello.How.Are.You.Today.</pre>

 

=={{header|ActionScript}}==

var tokens:Array = hello.split(",");

trace(tokens.join("."));

 

// Or as a one-liner

 

=={{header|Ada}}==

use Ada.Text_IO, Ada.Containers, Ada.Strings, Ada.Strings.Fixed, Ada.Strings.Maps;

 

Put (S & ".");

end loop;

 

=={{header|ALGOL 68}}==

 

OP +:= = (REF FLEX[]STRING in out, STRING item)VOID:(

printf(($g"."$, string split(beetles, ", "),$l$));

printf(($g"."$, char split(beetles, ", "),$l$))

{{out}}

<pre>

John Lennon.Paul McCartney.George Harrison.Ringo Starr.

John.Lennon..Paul.McCartney..George.Harrison..Ringo.Starr.

</pre>

 

=={{header|APL}}==

abc. 123. X. ⍝ 3 strings (char vectors), each with a period at the end.

 

=={{header|AppleScript}}==

 

intercalate(".", splitOn(",", "Hello,How,Are,You,Today"))

end run

set my text item delimiters to dlm

return strJoined

{{Out}}

<pre>Hello.How.Are.You.Today</pre>

Or,

 

set tokens to the text items of "Hello,How,Are,You,Today"

 

set my text item delimiters to "."

 

{{Out}}

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

{{works with|as|Raspberry Pi}}

 

/* ARM assembly Raspberry PI */

bx lr

 

=={{header|Arturo}}==

 

 

{{out}}

 

=={{header|Astro}}==

let tokens = text.split(||,||)

 

=={{header|AutoHotkey}}==

stringsplit, string, string, `,

loop, % string0

{

msgbox % string%A_Index%

 

=={{header|AWK}}==

 

s = "Hello,How,Are,You,Today"

split(s, arr, ",")

}

print

 

A more ''idiomatic'' way for AWK is

 

{

for(i=1; i <= NF; i++) printf $i ".";

print ""

 

which "tokenize" each line of input and this is achieved by using "," as field separator

=={{header|BASIC}}==

==={{header|Applesoft BASIC}}===

110 GOSUB 200"TOKENIZE

120 FOR I = 1 TO N

290 A$(N) = A$(N) + C$

300 NEXT TI

 

==={{header|BaCon}}===

BaCon includes extensive support for ''delimited strings''.

 

string$ = "Hello,How,Are,You,Today"

 

' Or simply replace the delimiter

 

{{out}}

Hello.How.Are.You.Today

Hello.How.Are.You.Today</pre>

 

==={{header|BBC BASIC}}===

{{works with|BBC BASIC for Windows}}

text$ = "Hello,How,Are,You,Today"

PRINT array$(i%) "." ;

NEXT

 

==={{header|Commodore BASIC}}===

Based on the AppleSoft BASIC version.

20 T$ = "HELLO,HOW,ARE,YOU,TODAY"

30 GOSUB 200, TOKENIZE

260 N = N + 1

270 NEXT L

==={{header|FreeBASIC}}===

redim tokens(0 to 0) as string

dim as string*1 ch

for i as uinteger = 0 to ubound(tokens)

print tokens(i);".";

 

==={{header|Liberty BASIC}}===

For i = 0 To 4

array$(i) = Word$("Hello,How,Are,You,Today", (i + 1), ",")

Next i

 

 

 

PowerBASIC has a few keywords that make parsing strings trivial: <code>PARSE</code>, <code>PARSE$</code>, and <code>PARSECOUNT</code>. (<code>PARSE$</code>, not shown here, is for extracting tokens one at a time, while <code>PARSE</code> extracts all tokens at once into an array. <code>PARSECOUNT</code> returns the number of tokens found.)

 

DIM parseMe AS STRING

parseMe = "Hello,How,Are,You,Today"

 

MSGBOX outP

 

==={{header|PureBasic}}===

 

'''As described

 

For i=1 To 5

ForEach MyStrings()

Print(MyStrings()+".")

 

'''Still, easier would be

 

==={{header|QBasic}}===

parseMe = "Hello,How,Are,You,Today"

 

PRINT "."; parsed(L0);

NEXT

 

==={{header|Run BASIC}}===

FOR i = 1 to 5

textArray$(i) = word$(text$,i,",")

print textArray$(i);" ";

 

==={{header|VBScript}}===

====One liner====

 

In fact, the Visual Basic solution (below) could have done the same, as Join() is available.

Unlike PowerBASIC, there is no need to know beforehand how many tokens are in the string -- <code>Split</code> automagically builds the array for you.

 

Dim parseMe As String, parsed As Variant

parseMe = "Hello,How,Are,You,Today"

 

MsgBox outP

 

=={{header|Batch File}}==

setlocal enabledelayedexpansion

call :tokenize %1 res

for %%i in (%str%) do set %2=!%2!.%%i

set %2=!%2:~1!

 

''Demo''

>tokenize.cmd "Hello,How,Are,You,Today"

Hello.How.Are.You.Today

 

=={{header|Bracmat}}==

Solution that employs string pattern matching to spot the commas

& :?ReverseList

& whl

)

& out$!List

Solution that starts by evaluating the input and employs the circumstance that the comma is a list constructing binary operator and that the string does not contain any other characters that are interpreted as operators on evaluation.

& :?ReverseList

& whl

)

& out$!List

 

=={{header|C}}==

This example uses the ''strtok()'' function to separate the tokens. This function is destructive (replacing token separators with '\0'), so we have to make a copy of the string (using ''strdup()'') before tokenizing. ''strdup()'' is not part of [[ANSI C]], but is available on most platforms. It can easily be implemented with a combination of ''strlen()'', ''malloc()'', and ''strcpy()''.

 

#include<stdio.h>

#include<stdlib.h>

 

return 0;

 

Another way to accomplish the task without the built-in string functions is to temporarily modify the separator character. This method does not need any additional memory, but requires the input string to be writeable.

 

typedef void (*callbackfunc)(const char *);

tokenize(array, ',', doprint);

return 0;

 

=={{header|C sharp|C#}}==

// or Regex.Split ( "Hello,How,Are,You,Today", "," );

// (Regex is in System.Text.RegularExpressions namespace)

string[] strings = str.Split(',');

Console.WriteLine(String.Join(".", strings));

 

=={{header|C++}}==

std::getline() is typically used to tokenize strings on a single-character delimiter

 

#include <sstream>

#include <vector>

copy(v.begin(), v.end(), std::ostream_iterator<std::string>(std::cout, "."));

std::cout << '\n';

 

{{works with|C++98}}

C++ allows the user to redefine what is considered whitespace. If the delimiter is whitespace, tokenization becomes effortless.

 

#include <locale>

#include <sstream>

copy(v.begin(), v.end(), std::ostream_iterator<std::string>(std::cout, "."));

std::cout << '\n';

 

{{works with|C++98}}

The boost library has multiple options for easy tokenization.

 

#include <vector>

#include <iterator>

copy(v.begin(), v.end(), std::ostream_iterator<std::string>(std::cout, "."))

std::cout << '\n';

 

=={{header|Ceylon}}==

{{works with|Ceylon 1.2}}

value input = "Hello,How,Are,You,Today";

value tokens = input.split(','.equals);

print(".".join(tokens));

 

=={{header|Clojure}}==

Using native Clojure functions and Java Interop:

 

Using the clojure.string library:

 

=={{header|COBOL}}==

This can be made to handle more complex cases; UNSTRING allows multiple delimiters, capture of which delimiter was used for each field, a POINTER for starting position (set on ending), along with match TALLYING.

 

identification division.

program-id. tokenize.

goback.

end program tokenize.

 

{{out}}

=={{header|CoffeeScript}}==

 

arr = "Hello,How,Are,You,Today".split ","

console.log arr.join "."

 

=={{header|ColdFusion}}==

=== Classic tag based CFML ===

<cfoutput>

<cfset wordListTag = "Hello,How,Are,You,Today">

#Replace( wordListTag, ",", ".", "all" )#

</cfoutput>

{{Output}}

<pre>

 

=== Script Based CFML ===

wordList = "Hello,How,Are,You,Today";

splitList = replace( wordList, ",", ".", "all" );

writeOutput( splitList );

{{Output}}

<pre>

There are libraries out there that handle splitting (e.g., [http://www.cliki.net/SPLIT-SEQUENCE SPLIT-SEQUENCE], and the more-general [http://weitz.de/cl-ppcre/ CL-PPCRE]), but this is a simple one-off, too. When the words are written with write-with-periods, there is no final period after the last word.

 

(loop for start = 0 then (1+ finish)

for finish = (position #\, string :start start)

 

(defun write-with-periods (strings)

 

=={{header|Cowgol}}==

include "strings.coh";

 

print(".\n");

i := i + 1;

{{out}}

<pre>Hello.

You.

Today.</pre>

 

=={{header|D}}==

import std.stdio, std.string;

 

"Hello,How,Are,You,Today".split(',').join('.').writeln;

{{out}}

<pre>Hello.How.Are.You.Today</pre>

=== Using String.split ===

{{libheader| System.SysUtils}}

program Tokenize_a_string;

 

end.

 

 

=== Using TStringList ===

program TokenizeString;

 

 

end.

 

The result is:

 

Hello

How

You

Today

 

=={{header|Dyalect}}==

{{out}}

<pre>Hello.How.Are.You.Today</pre>

 

=={{header|Déjà Vu}}==

{{out}}

<pre>Hello.How.Are.You.Today</pre>

 

=={{header|E}}==

 

=={{header|Elena}}==

import extensions;

public program()

{

{

console.print(s,".")

}

 

=={{header|Elixir}}==

tokens = String.split("Hello,How,Are,You,Today", ",")

IO.puts Enum.join(tokens, ".")

 

=={{header|Erlang}}==

-export([start/0]).

 

Lst = string:tokens("Hello,How,Are,You,Today",","),

io:fwrite("~s~n", [string:join(Lst,".")]),

 

=={{header|Euphoria}}==

sequence out

integer first, delim

for i = 1 to length(s) do

puts(1, s[i] & ',')

 

=={{header|F_Sharp|F#}}==

 

=={{header|Factor}}==

 

=={{header|Falcon}}==

'''VBA/Python programmer's approach to this solution, not sure if it's the most falconic way'''

/* created by Aykayayciti Earl Lamont Montgomery

April 9th, 2018 */

 

> b

{{out}}

<pre>

A string can be split on a given character, returning a list of the intervening strings.

 

class Main

{

}

}

 

=={{header|Forth}}==

There is no standard string split routine, but it is easily written. The results are saved temporarily to the dictionary.

 

here >r 2swap

begin

1 ?do dup 2@ type ." ." cell+ cell+ loop 2@ type ;

 

 

=={{header|Fortran}}==

{{works with|Fortran|90 and later}}

 

CHARACTER(23) :: str = "Hello,How,Are,You,Today"

END DO

 

=={{header|Frink}}==

println[join[".", split[",", "Hello,How,Are,You,Today"]]]

 

=={{header|Gambas}}==

'''[https://gambas-playground.proko.eu/?gist=218e240236cdf1419a405abfed906ed3 Click this link to run this code]'''

Dim sString As String[] = Split("Hello,How,Are,You,Today")

 

Print sString.Join(".")

 

Output:

<pre>

 

=={{header|GAP}}==

# [ "Hello", "How", "Are", "You", "Today" ]

 

JoinStringsWithSeparator(last, ".");

 

=={{header|Genie}}==

 

init

words:array of string[] = str.split(",")

joined:string = string.joinv(".", words)

 

{{out}}

 

=={{header|Go}}==

 

import (

s := "Hello,How,Are,You,Today"

fmt.Println(strings.Join(strings.Split(s, ","), "."))

 

=={{header|Groovy}}==

 

=={{header|Haskell}}==

'''Using Data.Text'''

 

import Data.Text (splitOn,intercalate)

import qualified Data.Text.IO as T (putStrLn)

 

 

Output: Hello.How.Are.You.Today

The necessary operations are unfortunately not in the standard library (yet), but simple to write:

 

splitBy _ [] = []

splitBy f list = first : splitBy f (dropWhile f rest) where

-- using regular expression to split:

import Text.Regex

 

Tokenizing can also be realized by using unfoldr and break:

Hello

How

Are

You

* You need to import the modules Data.List and Control.Arrow

 

 

=={{header|HicEst}}==

 

nWords = INDEX(string, ',', 256) + 1

DO i = 1, nWords

WRITE(APPend) TRIM(CHAR(i, maxWordLength, list)), '.'

 

=={{header|Icon}} and {{header|Unicon}}==

A := []

"Hello,How,Are,You,Today" ? {

every writes(!A,".")

write()

 

{{out}}

 

A Unicon-specific solution is:

 

procedure main()

every writes(!A,".")

write()

 

One wonders what the expected output should be with the input string ",,,,".

 

=={{header|Io}}==

 

=={{header|J}}==

] t=: <;._1 ',',s

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

 

'.' (I.','=s)}s NB. two steps combined

 

Alternatively using the system library/script <tt>strings</tt>

',' splitstring s

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

 

'.' joinstring ',' splitstring s

 

<tt>splitstring</tt> and <tt>joinstring</tt> also work with longer "delimiters":

 

But, of course, this could be solved with simple string replacement:

 

 

The task asks us to ''Separate the string "Hello,How,Are,You,Today" by commas into an array (or list) so that each element of it stores a different word.'' but for many purposes the original string is an adequate data structure. Note also that given a string, a list of "word start" indices and "word length" integers can be logically equivalent to having an "array of words" -- and, depending on implementation details may be a superior or inferior choice to some other representation. But, in current definition of this task, the concept of "word length" plays no useful role.

Note also that J provides several built-in concepts of parsing: split on leading delimiter, split on trailing delimiter, split J language words. Also, it's sometimes more efficient to append to a string than to prepend to it. So a common practice for parsing on an embedded delimiter is to append a copy of the delimiter to the string and then use the appended result:

 

 

Here '''fn''' is applied to each ',' delimited substring and the results are assembled into an array.

 

Or, factoring out the names:

 

=={{header|Java}}==

{{works with|Java|1.8+}}

 

 

{{works with|Java|1.4+}}

 

String words[] = toTokenize.split(",");//splits on one comma, multiple commas yield multiple splits

for(int i=0; i<words.length; i++) {

System.out.print(words[i] + ".");

 

The other way is to use StringTokenizer. It will skip any empty tokens. So if two commas are given in line, there will be an empty string in the array given by the split function, but no empty string with the StringTokenizer object. This method takes more code to use, but allows you to get tokens incrementally instead of all at once.

 

{{works with|Java|1.0+}}

 

StringTokenizer tokenizer = new StringTokenizer(toTokenize, ",");

while(tokenizer.hasMoreTokens()) {

System.out.print(tokenizer.nextToken() + ".");

 

=={{header|JavaScript}}==

 

 

=={{header|jq}}==

"Hello,How,Are,You,Today"

 

=={{header|Jsish}}==

Being in the ECMAScript family, Jsi is blessed with many easy to use character, string and array manipulation routines.

 

{{out}}

<pre>Hello.How.Are.You.Today</pre>

 

=={{header|Julia}}==

s = "Hello,How,Are,You,Today"

a = split(s, ",")

println("Splits into ", a)

println("Reconstitutes to \"", t, "\"")

 

{{out}}

 

=={{header|K}}==

 

{{out}}

"Hello.How.Are.You.Today"

</pre>

 

=={{header|Klingphix}}==

 

{{out}}

<pre>Hello.How.Are.You.Today.

=={{header|Kotlin}}==

{{works with|Kotlin|1.0b4}}

val input = "Hello,How,Are,You,Today"

println(input.split(',').joinToString("."))

{{out}}

<pre>Hello.How.Are.You.Today</pre>

 

=={{header|LabVIEW}}==

 

=={{header|Lambdatalk}}==

{S.replace , by . in Hello,How,Are,You,Today}.

-> Hello.How.Are.You.Today.

 

=={{header|Lang5}}==

 

=={{header|LDPL}}==

DATA:

explode/words is text vector

add 1 and i in i

repeat

 

=={{header|LFE}}==

 

> (set split (string:tokens "Hello,How,Are,You,Today" ","))

("Hello" "How" "Are" "You" "Today")

> (string:join split ".")

"Hello.How.Are.You.Today"

 

=={{header|Lingo}}==

_player.itemDelimiter = ","

output = ""

delete the last char of output

put output

 

=={{header|Logo}}==

{{works with|UCB Logo}}

output parse map [ifelse ? = :sep ["| |] [?]] :str

 

This form is more robust, doing the right thing if there are embedded spaces.

if empty? :str [output lput :w :acc]

ifelse equal? first :str :by ~

[output (split butfirst :str :by lput :w :acc)] ~

[output (split butfirst :str :by :acc lput first :str :w)]

 

 

=={{header|Logtalk}}==

Using Logtalk built-in support for Definite Clause Grammars (DCGs) and representing the strings as atoms for readbility:

:- object(spliting).

 

 

:- end_object.

{{out}}

<pre>

=={{header|Lua}}==

Split function callously stolen from the lua-users wiki

local sep, fields = sep or ":", {}

local pattern = string.format("([^%s]+)", sep)

 

local str = "Hello,How,Are,You,Today"

{{out}}

<pre>Hello.How.Are.You.Today</pre>

 

=={{header|M2000 Interpreter}}==

Module CheckIt {

Function Tokenize$(s){

}

Checkit

 

=={{header|M4}}==

define(`set',`define(`$1[$2]',`$3')')

define(`get',`defn($1[$2])')

define(`show',

`ifelse(eval(j<n),1,`get(a,j).`'define(`j',incr(j))`'show')')

 

{{out}}

 

=={{header|Maple}}==

{{Out|Output}}

<pre>"Hello.How.Are.You.Today"</pre>

 

=={{header|Mathematica}}/{{header|Wolfram Language}}==

 

=={{header|MATLAB}} / {{header|Octave}}==

s=strsplit('Hello,How,Are,You,Today',',')

fprintf(1,'%s.',s{:})

 

{{out}}

 

=={{header|Maxima}}==

 

=={{header|MAXScript}}==

for word in (filterString "Hello,How,Are,You,Today" ",") do

(

output += (word + ".")

)

 

=={{header|Mercury}}==

:- module string_tokenize.

:- interface.

Tokens = string.split_at_char((','), "Hello,How,Are,You,Today"),

io.write_list(Tokens, ".", io.write_string, !IO),

 

=={{header|min}}==

{{works with|min|0.19.3}}

 

=={{header|MiniScript}}==

 

=={{header|MMIX}}==

EOS IS 0

NL IS 10

LDBU t,tp

PBNZ t,2B % UNTIL EOB(uffer)

{{out}}

<pre>

 

=={{header|Modula-3}}==

 

IMPORT IO, TextConv;

END;

IO.Put("\n");

 

=={{header|MUMPS}}==

NEW I,J,INP

SET INP="Hello,how,are,you,today"

NEW J FOR J=1:1:I WRITE INP(J) WRITE:J'=I "."

KILL I,J,INP // Kill is optional. "New" variables automatically are killed on "Quit"

 

In use:

 

=={{header|Nanoquery}}==

print word + "."

{{out}}

<pre>Hello.How.Are.You.Today.</pre>

 

=={{header|Nemerle}}==

using System.Console;

using Nemerle.Utility.NString;

// a quick in place list comprehension takes care of that

}

 

=={{header|NetRexx}}==

* 20.08.2012 Walter Pachl derived from REXX Version 3

**********************************************************************/

Say ss.word(i)'.'

End

Output as in REXX version

 

=={{header|NewLISP}}==

 

=={{header|Nial}}==

Define Array with input string:

 

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

|H|e|l|l|o|,|H|o|w|,|A|r|e|,|Y|o|u|,|T|o|d|a|y|

 

Split string at the commas:

 

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

|+-+-+-+-+-+|+-+-+-+|+-+-+-+|+-+-+-+|+-+-+-+-+-+|

||H|e|l|l|o|||H|o|w|||A|r|e|||Y|o|u|||T|o|d|a|y||

|+-+-+-+-+-+|+-+-+-+|+-+-+-+|+-+-+-+|+-+-+-+-+-+|

 

Join string with <code>.</code> and remove last <code>.</code>

 

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

|H|e|l|l|o|.|H|o|w|.|A|r|e|.|Y|o|u|.|T|o|d|a|y|

 

Less cluttered display, using <code>set "sketch;set "nodecor</code> display switches.

 

Hello,How,Are,You,Today

t:= s eachall = `, cut s

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

u:=front content (cart t `.)

 

=={{header|Nim}}==

 

let text = "Hello,How,Are,You,Today"

let tokens = text.split(',')

 

{{out}}

 

=={{header|Objeck}}==

class Parse {

function : Main(args : String[]) ~ Nil {

};

}

 

=={{header|Objective-C}}==

{{works with|Cocoa}}

 

NSArray *tokens = [text componentsSeparatedByString:@","];

NSString *result = [tokens componentsJoinedByString:@"."];

 

=={{header|OCaml}}==

To split on a single-character separator:

String.concat "." words

 

The function split_on_char has been introduced in OCaml 4.04. In previous versions, it could be implemented by:

 

let r = ref [] in

let j = ref (String.length s) in

end

done;

 

=={{header|Oforth}}==

 

 

{{out}}

 

=={{header|ooRexx}}==

do while text \= ''

parse var text word1 ',' text

call charout 'STDOUT:',word1'.'

{{out}}

<pre>Hello.How.Are.You.Today.</pre>

 

=={{header|OpenEdge/Progress}}==

i_c AS CHAR

):

MESSAGE

tokenizeString( "Hello,How,Are,You,Today" )

{{out}}

<pre>

 

=={{header|Oz}}==

{System.printInfo T#"."}

 

=={{header|PARI/GP}}==

{{Works with|PARI/GP|2.7.4 and above}}

 

\\ Tokenize a string str according to 1 character delimiter d. Return a list of tokens.

\\ Using ssubstr() from http://rosettacode.org/wiki/Substring#PARI.2FGP

print("3.",tokenize(",Hello,,How,Are,You,Today",","));

}

 

{{Output}}

{{Works with|PARI/GP|2.7.4 and above}}

 

\\ Tokenize a string str according to 1 character delimiter d. Return a list of tokens.

\\ Using ssubstr() from http://rosettacode.org/wiki/Substring#PARI.2FGP

print("7. 0 pp: ", stok("",","));

}

 

{{Output}}

=={{header|Pascal}}==

{{works with|Free_Pascal}}

 

{$mode objfpc}{$H+}

Tokens.Free;

end;

 

The result is:

 

=={{header|Perl}}==

CLI one-liner form:

which is a compact way of telling Perl to do

LINE: while (defined($_ = <ARGV>)) {

chomp $_;

continue {

die "-p destination: $!\n" unless print $_;

 

=={{header|Phix}}==

<span style="color: #0000FF;">?</span><span style="color: #7060A8;">join</span><span style="color: #0000FF;">(</span><span style="color: #7060A8;">split</span><span style="color: #0000FF;">(</span><span style="color: #008000;">"Hello,How,Are,You,Today"</span><span style="color: #0000FF;">,</span><span style="color: #008000;">","</span><span style="color: #0000FF;">),</span><span style="color: #008000;">"."</span><span style="color: #0000FF;">)</span>

{{Out}}

<pre>

 

=={{header|Phixmonti}}==

 

=={{header|PHP}}==

{{works with|PHP|5.x}}

 

$str = 'Hello,How,Are,You,Today';

echo implode('.', explode(',', $str));

 

=={{header|PicoLisp}}==

 

=={{header|Pike}}==

 

=={{header|PL/I}}==

declare s character (100) initial ('Hello,How,Are,You,Today');

declare n fixed binary (31);

put skip list (string(table));

end;

{{out}}

<pre>Hello.How.Are.You.Today</pre>

 

=={{header|PL/M}}==

/* CP/M CALLS */

BDOS: PROCEDURE (FN, ARG); DECLARE FN BYTE, ARG ADDRESS; GO TO 5; END BDOS;

 

CALL EXIT;

{{out}}

<pre>HELLO. HOW. ARE. YOU. TODAY. </pre>

 

=={{header|Plain English}}==

Start up.

Split "Hello,How,Are,You,Today" into some string things given the comma byte.

If the string thing's next is not nil, append the byte to the string.

Put the string thing's next into the string thing.

{{out}}

<pre>

First show the use of sysparse_string to break up a string and make a list of strings.

 

lvars list;

sysparse_string('the cat sat on the mat') -> list;

;;; print the list of strings

list =>

 

By giving it an extra parameter 'true' we can make it recognize numbers and produce a list of strings and numbers

 

sysparse_string('one 1 two 2 three 3 four 4', true) -> list;

;;; print the list of strings and numbers

** <true>

isinteger(list(2))=>

 

Now show some uses of the built in procedure sys_parse_string, which allows more options:

 

true -> pop_pr_quotes;

;;;

;;; print the list of strings

strings =>

 

If {% ... %} were used instead of [% ... %] the result would be

a vector (i.e. array) of strings rather than a list of strings.

 

;;; print the vector

strings =>

It is also possible to give sys_parse_string a 'conversion' procedure, which is applied to each of the tokens.

E.g. it could be used to produce a vector of numbers, using the conversion procedure 'strnumber', which converts a string to a number:

 

{% sys_parse_string('100 101 102 103 99.9 99.999', strnumber) %} -> numbers;

;;; the result is a vector containing integers and floats,

;;; which can be printed thus:

numbers =>

 

Using lower level pop-11 facilities to tokenise the string:

 

lvars str='Hello,How,Are,You,Today';

;;; Iterate over string

endif;

;;; Reverse the list

 

Since the task requires to use array we convert list to array

 

destlist(ls);

;;; Build a vector from them

printf(ar(i), '%s.');

endfor;

 

We could use list directly for printing:

 

printf(i, '%s.');

 

so the conversion to vector is purely to satisfy task formulation.

=={{header|PowerShell}}==

{{works with|PowerShell|1}}

 

{{works with|PowerShell|2}}

 

{{works with|PowerShell|2}}

The StringSplitOptions enumeration weeds out the return of empty elements.

"Hello,How,Are,You,Today", ",,Hello,,Goodbye,," | ForEach-Object {($_.Split(',',[StringSplitOptions]::RemoveEmptyEntries)) -join "."}

{{Out}}

<pre>

=={{header|Prolog}}==

{{works with|SWI Prolog}}

splitup(Sep,[A|AL],B) --> [A], {\+ [A] = Sep }, splitup(Sep,AL,B).

splitup(Sep,[],[B|BL]) --> Sep, splitup(Sep,B,BL).

phrase(splitup(".",Tokens),Backtogether),

string_to_list(ABack,Backtogether),

{{out}}

<pre>

this can be accomplished in a few lines in the top level:

 

?- split_string("Hello,How,Are,You,Today", ",", "", Split),

| atomics_to_string(Split, ".", PeriodSeparated),

| writeln(PeriodSeparated).

Hello.How.Are.You.Today

 

=={{header|Python}}==

{{works with|Python|2.5}}{{works with|Python|3.0}}

 

tokens = text.split(',')

 

Or if interpretation of the task description means you don't need to keep an intermediate array:

 

=={{header|Q}}==

 

{{out}}

=={{header|QB64}}==

''CBTJD'': 2020/03/12

FOR na = 1 TO LEN(a$) ' | Start loop to count number of commas.

IF MID$(a$, na, 1) = "," THEN nc = nc + 1 ' | For each comma, increment nc.

PRINT LEFT$(tf$, LEN(tf$) - 1) ' | Print all but the last period of tf$.

END ' | Program end.

 

'''Alternative method using word$ function:'''

----

''CBTJD'': 2020/03/12

DIM t$(LEN(a$) / 2) ' | Create an overestimated sized array.

FOR nd = 1 TO LEN(a$) ' | Start loop to find each comma.

DONE: ' | Label for bail destination of word count error check.

END FUNCTION ' | End of function.

 

=={{header|Quackery}}==

 

witheach

[ dup char , = iff

[ witheach [ echo$ say "." ] ] is display ( [ --> )

 

{{Out}}

 

=={{header|R}}==

junk <- strsplit(text, split=",")

 

or the one liner

 

 

=={{header|Racket}}==

 

#lang racket

(string-join (string-split "Hello,How,Are,You,Today" ",") ".")

;; -> "Hello.How.Are.You.Today"

 

=={{header|Raku}}==

(formerly Perl 6)

{{works with|Rakudo|#22 "Thousand Oaks"}}

 

Or with function calls:

 

 

=={{header|Raven}}==

 

=={{header|REBOL}}==

tokens: parse original ","

dotted: "" repeat i tokens [append dotted rejoin [i "."]]

 

{{out}}

 

=={{header|Red}}==

>> tokens: split str ","

>> probe tokens

>> periods: replace/all form tokens " " "." ;The word FORM converts the list series to a string removing quotes.

>> print periods ;then REPLACE/ALL spaces with period

 

=={{header|Retro}}==

: char ( -$ ) " " ;

: tokenize ( $-$$ )

[ tokenize action dup 1 <> ] while drop

^buffer'get drop ;

 

This will suffice to split a string into an array of substrings. It is used like this:

 

 

Since the buffer' vocabulary creates a zero-terminated buffer, we can display it using the each@ combinator and a simple quote:

 

 

=={{header|REXX}}==

===version 1===

This REXX version doesn't append a period to the last word in the list.

original = 'Hello,How,Are,You,Today' /*some words separated by commas (,). */

say 'The input string:' original /*display original string ──► terminal.*/

say @.j || left(., j\==#) /*maybe append a period (.) to a word. */

end /*j*/ /* [↑] don't append a period if last. */

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

<pre>

 

Hello,Betty Sue,How,Are,You,Today

sss='Hello,How,Are,You,Today'

say 'input string='sss

say word(ss,i)dot

End

'''output''' is similar to REXX version 1.

 

=={{header|Ring}}==

see substr("Hello,How,Are,You,Today", ",", ".")

 

=={{header|Ruby}}==

 

=={{header|Rust}}==

let s = "Hello,How,Are,You,Today";

let tokens: Vec<&str> = s.split(",").collect();

println!("{}", tokens.join("."));

 

=={{header|S-lang}}==

 

{{out}}

 

=={{header|Scala}}==

 

=={{header|Scheme}}==

{{works with|Guile}}

(define s "Hello,How,Are,You,Today")

(define words (map match:substring (list-matches "[^,]+" s)))

(display (list-ref words n))

(if (< n (- (length words) 1))

 

(with SRFI 13)

(define words (string-tokenize s (char-set-complement (char-set #\,))))

 

{{works with|Gauche Scheme}}

(string-join

(string-split "Hello,How,Are,You,Today" #\,)

{{output}}

<pre>

 

=={{header|Seed7}}==

 

 

=={{header|Self}}==

((s splitOn: ',') joinUsing: '.') printLine.

 

=={{header|Sidef}}==

=={{header|Simula}}==

 

CLASS TEXTARRAY(N); INTEGER N;

 

END.

{{out}}

<pre>HELLO.HOW.ARE.YOU.TODAY.</pre>

 

=={{header|Slate}}==

 

=={{header|Smalltalk}}==

array := 'Hello,How,Are,You,Today' subStrings: $,.

 

Some implementations also have a ''join:'' convenience method that allows the following shorter solution:

 

 

The solution displaying a trailing period would be:

 

array := 'Hello,How,Are,You,Today' subStrings: $,.

 

=={{header|SNOBOL4}}==

For this task, it's convenient to define Perl-style split( ) and join( ) functions.

 

split t = table()

sp1 str pos(0) (break(chs) | rem) $ t<i = i + 1>

* # Test and display

output = join('.',split(',','Hello,How,Are,You,Today'))

 

{{out}}

 

=={{header|Standard ML}}==

 

Test:

 

 

=={{header|Swift}}==

 

{{works with|Swift|3.x}}

let tokens = text.components(separatedBy: ",") // for single or multi-character separator

print(tokens)

let result = tokens.joined(separator: ".")

 

{{works with|Swift|2.x}}

let tokens = text.characters.split(",").map{String($0)} // for single-character separator

print(tokens)

let result = tokens.joinWithSeparator(".")

 

{{works with|Swift|1.x}}

let tokens = split(text, { $0 == "," }) // for single-character separator

println(tokens)

let result = ".".join(tokens)

 

 

let text = "Hello,How,Are,You,Today"

let tokens = text.componentsSeparatedByString(",")

 

=={{header|Tcl}}==

Generating a list form a string by splitting on a comma:

 

Joining the elements of a list by a period:

 

Thus the whole thing would look like this:

 

If you'd like to retain the list in a variable with the name "words", it would only be marginally more complex:

 

(In general, the <tt>regexp</tt> command is also used in Tcl for tokenization of strings, but this example does not need that level of complexity.)

<code>tr</code> knows nothing about arrays, so this solution only changes each comma to a period.

 

 

=={{header|TUSCRIPT}}==

$$ MODE TUSCRIPT

SET string="Hello,How,Are,You,Today"

SET string=SPLIT (string,":,:")

SET string=JOIN (string,".")

 

=={{header|TXR}}==

sequences of non-commas.

 

@(coll)@{token /[^,]+/}@(end)

@(output)

@(rep)@token.@(last)@token@(end)

 

Different approach. Collect tokens, each of

before a comma, or else extends to the end of the line.

 

@(coll)@(maybe)@token,@(or)@token@(end)@(end)

@(output)

@(rep)@token.@(last)@token@(end)

 

Using TXR Lisp:

 

 

=={{header|UNIX Shell}}==

{{works with|Bourne Shell}}

 

(IFS=,

printf '%s.' $string

 

----

{{works with|Bourne Again SHell}}

{{works with|Public Domain Korn SHell|5.2.14}}

stripchar-l ()

#removes the specified character from the left side of the string

join "$( split "$list" "$input_delimiter" )" \

"$contains_a_space" "$output_delimiter";

 

''Example''

 

 

----

{{works with|ksh93}}

{{works with|zsh}}

string1="Hello,How,Are,You,Today"

elements_quantity=$(echo $string1|tr "," "\n"|wc -l)

 

# or to cheat

 

=={{header|UnixPipes}}==

{{works with|Bourne Shell}}

(IFS=, read -r A B; echo "$A".; test -n "$B" && (echo "$B" | token))

}

 

 

=={{header|Ursa}}==

set text "Hello,How,Are,You,Today"

decl string<> tokens

out tokens<i> "." console

end for

 

=={{header|Ursala}}==

second order function parameterized by the delimiter. Character

literals are preceded by a backquote.

 

token_list = sep`, 'Hello,How,Are,You,Today'

#cast %s

 

{{out}}

<pre>

 

=={{header|Vala}}==

string s = "Hello,How,Are,You,Today";

print(@"$(string.joinv(".", s.split(",")))");

{{out}}

<pre>Hello.How.Are.You.Today</pre>

 

=={{header|VBA}}==

Dim temp() As String

temp = Tokenize("Hello,How,Are,You,Today", ",")

Private Sub Display(arr() As String, sep As String)

Debug.Print Join(arr, sep)

{{Out}}

<pre>Hello How Are You Today</pre>

 

=={{header|VBScript}}==

s = "Hello,How,Are,You,Today"

WScript.StdOut.Write Join(Split(s,","),".")

{{Out}}

<pre>Hello.How.Are.You.Today</pre>

The contents of each text register is then displayed to user, separated by a period.

 

Ins_Text("Hello,How,Are,You,Today")

 

}

 

 

=={{header|WinBatch}}==

 

result = ''

BoxOpen('WinBatch Tokenizing Example', '')

next

display(10, 'End of Program', 'Dialog and program will close momentarily.')

 

{{out}}

 

=={{header|Wortel}}==

Returns

<pre>"Hello.How.Are.You.Today"</pre>

 

=={{header|Wren}}==

var t = s.split(",").join(".") + "."

 

{{out}}

 

=={{header|XPath 2.0}}==

 

{{out}}

 

=={{header|XPL0}}==

include c:\cxpl\codes;

int I, J, K, Char;

for K:= 4 downto 0 do [Text(0, addr Array(K,0)); ChOut(0, ^.)];

CrLf(0);

 

The 'addr' operator is used to fetch the 32-bit address of Array rather

 

=={{header|Yabasic}}==

 

n = token("Hello. How are you today?", s$(), ".? ")

if i < n print ".";

next

 

=={{header|zkl}}==

 

=={{header|Zoea}}==

program: tokenize_a_string

input: "Hello,How,Are,You,Today"

output: "Hello.How.Are.You.Today"

 

=={{header|Zoea Visual}}==

 

=={{header|Zsh}}==

tokens=(${(s:,:)str})

 

Or, using SH_SPLIT_WORD:

 

 

{{omit from|PARI/GP|No real capacity for string manipulation}}