mirror of https://github.com/icedream/langproc.git
62 lines
1.2 KiB
Markdown
62 lines
1.2 KiB
Markdown
|
Simple Language Processor
|
|||
|
=========================
|
|||
|
|
|||
|
_Deutsch:_
|
|||
|
|
|||
|
Dieses simple Werkzeug wurde in C# geschrieben und kann s<>mtliche W<>rter aus
|
|||
|
nicht-verk<72>rzenden grammatischen Regeln erzeugen.
|
|||
|
|
|||
|
Daf<EFBFBD>r muss eine Datei erstellt werden, die alle Regeln und Terminale enth<74>lt und
|
|||
|
optional eine maximale L<>nge (Standard: 5).
|
|||
|
|
|||
|
Die Datei sollte so <20>hnlich wie hier aussehen:
|
|||
|
|
|||
|
```
|
|||
|
# Maximale L<>nge
|
|||
|
n=5
|
|||
|
|
|||
|
# Terminale
|
|||
|
L={a,b}
|
|||
|
|
|||
|
# Regeln
|
|||
|
S->AB
|
|||
|
A->Aa|a
|
|||
|
B->Bb|b
|
|||
|
```
|
|||
|
|
|||
|
Die W<>rter k<>nnen dann mittels ``langproc <Datei>`` berechnet werden.
|
|||
|
|
|||
|
Bitte benutzt es nur zur <20>berpr<70>fung der Funktionalit<69>t von grammatischen Regeln.
|
|||
|
|
|||
|
_English:_
|
|||
|
|
|||
|
This simple tool is written in C# and is able to calculate possible words from
|
|||
|
non-shortening grammatic rules.
|
|||
|
|
|||
|
For this to work, create a file containing the grammatic rules and terminals and
|
|||
|
optionally variables defining the maximum length (defaults to 5).
|
|||
|
|
|||
|
The file should look similar to this:
|
|||
|
|
|||
|
```
|
|||
|
# Maximum length
|
|||
|
n=5
|
|||
|
|
|||
|
# Terminals
|
|||
|
L={a,b}
|
|||
|
|
|||
|
# Grammatic rules
|
|||
|
S->AB
|
|||
|
A->Aa|a
|
|||
|
B->Bb|b
|
|||
|
```
|
|||
|
|
|||
|
The words can then be calculated via ``langproc <Datei>``.
|
|||
|
|
|||
|
Please use it only to make sure your grammatic rules would work out properly.
|
|||
|
|
|||
|
License
|
|||
|
-------
|
|||
|
|
|||
|
This work is licensed under the GNU General Public License Version 3.
|
|||
|
For more info look into the LICENSE.txt file.
|