Here is a recursive parser quiz.
The challenge (requested here) is to implement a text Spintax module.
Usage example:
The output:
What is Spintax: What is spintax
So are there any parser gurus here???
The challenge (requested here) is to implement a text Spintax module.
Usage example:
B4X:
Sub Activity_Create(FirstTime As Boolean)
Dim s As String = "{This {article|content} is {spun|spun-out}|Any {article|content} {can|could} be {spun|spun-out}}"
Dim sentences As List = Spintax(s)
For Each sentence As StringBuilder In sentences
Log(sentence)
Next
End Sub
Online Spintax tool: UberToolz : Output Content From Nested SpintaxThis article is spun
This article is spun-out
This content is spun
This content is spun-out
Any article can be spun
Any article can be spun-out
Any article could be spun
Any article could be spun-out
Any content can be spun
Any content can be spun-out
Any content could be spun
Any content could be spun-out
What is Spintax: What is spintax
So are there any parser gurus here???