Posted
by rahul
on Stack Overflow
See other posts from Stack Overflow
or by rahul
Published on 2010-03-22T15:27:47Z
Indexed on
2010/03/22
15:41 UTC
Read the original article
Hit count: 390
Please help me find a grammar or automaton to decide the following language:
anbncn where n>=1
© Stack Overflow or respective owner
as seen on Stack Overflow
- Search for 'Stack Overflow'
hi
I want to write a program to gives grammar as input and change it to LL1.
my problem is converting to LL1 I don't have any algorithm to convert. I earn grammar from some input text by a simple text analyzer but how I can change it to LL1 ? is there any algorithm that is clear to implement.
>>> More
as seen on Stack Overflow
- Search for 'Stack Overflow'
Is there anyway to use the Link Grammar or AbiSource grammar checker in PHP (or C# but I'd prefer php)? I need to have a tree structure for english sentences. Any ideas? The only things I found were in C and I can't use them on a shared host.
>>> More
as seen on Stack Overflow
- Search for 'Stack Overflow'
I'm building a custom expression parser and evaluator for production enviroment to provide a limited DSL to the users. The parser itself as the DSL, need to be simple. The parser is going to be built in an exotic language that doesn't support dynamic expression parsing nor has any parser generator…
>>> More
as seen on Stack Overflow
- Search for 'Stack Overflow'
How would I separate the below string into its parts. What I need to separate is each < Word including the angle brackets from the rest of the string. So in the below case I would end up with several strings 1. "I have to break up with you because " 2. "< reason " (without the spaces) 3. "…
>>> More
as seen on Stack Overflow
- Search for 'Stack Overflow'
I am in need of parsing a small subset of English for one of my project, described as a context-free grammar with (1-level) feature structures (example) and I need to do it efficiently .
Right now I'm using NLTK's parser which produces the right output but is very slow. For my grammar of ~450 fairly…
>>> More
as seen on Stack Overflow
- Search for 'Stack Overflow'
I'm working on a javascript game and I've got an automata system controlling game time and sprite animation as well as giving a hand to the path finding system for timing and such. My problem is on slow browsers the javascript loop I'm using for counting the time is not very accurate. It tends to…
>>> More
as seen on Stack Overflow
- Search for 'Stack Overflow'
help me to solve this problem
anbncn where n=1
>>> More
as seen on Programmers
- Search for 'Programmers'
I would like to have a deterministic finite automata (DFA) simulated in Mercury.
But I’m s(t)uck at several places.
Formally, a DFA is described with the following characteristics:
a setOfStates S,
an inputAlphabet E <-- summation symbol,
a transitionFunction : S × E -- S,
a startState…
>>> More
as seen on Stack Overflow
- Search for 'Stack Overflow'
I'm working on a JavaScript game and I've got an automata system controlling game time and sprite animation as well as giving a hand to the path finding system for timing and such. My problem is on slow browsers the JavaScript loop I'm using for counting the time is not very accurate. It tends to…
>>> More
as seen on Stack Overflow
- Search for 'Stack Overflow'
I'm designing a programming language for automata theory. My goal is to allow programmers to use machines (DFA, NFA, etc...) as units in expressions.
I'm confused whether the language should be compiled, interpreted, or jit-compiled! My intuition is that compilation is a good choice, for some operations…
>>> More
