|
What about a good software to check grammar in English language?
Started by monkey_boys on
, 3 posts
by 3 people.
Answer Snippets (Read the full thread at superuser):
SpellCheckPlus is a grammar checker that finds common spelling errors and grammatical mistakes in English.
|
|
How to define a grammar (context-free) for a new programming language (imperative programming language) that you want to design from scratch.
In other words : how do you proceed when you want to create a new programming language from scratch.
Started by Ayoub on
, 8 posts
by 8 people.
Answer Snippets (Read the full thread at stackoverflow):
(Assuming you want to write a context free grammar, that is.)
you need to buy these two books Language....
Be best served by starting with an existing language and modifying its grammar to match what ( Extended Backus-Naur Form ).
|
|
Many programming languages allow trailing commas in their grammar following the last item in a list. Supposedly this was done to simplify automatic code generation, which is understandable.
As an example, the following is a perfectly legal array initialization...
Started by polygenelubricants on
, 5 posts
by 4 people.
Answer Snippets (Read the full thread at stackoverflow):
I'm not an expert on the commas, but I know anybody know] other grammar "peculiarities" of modern programming languages?
One of my favorites, Modula-3 , was designed in 1990 with Niklaus....
Of the language this first appeared in, though.
|
Ask your Facebook Friends
|
I'm developing a small programming language based mostly of the C99 standard and I've already written a fairly decent lexer in java and now I'm looking to generate a Java Parser from the grammar. I know there's Bison , but that seems to only generate ...
Started by Yoely on
, 4 posts
by 4 people.
Answer Snippets (Read the full thread at stackoverflow):
The JFlex home page....
I've been quite impressed by BNFC , which is able to generate parsers in Java as well as in C, C++, C#, F#, Haskell, and OCaml .
Another couple to look at are JavaCC and SableCC (it has been a long time since I looked at SableCC) .
|
|
I'm trying to work on a kind of code generator to help unit-testing an legacy C/C++ blended project. I don't find any kind of independent tool can generate stub code from declaration. So I decide to build one, it shouldn't be that hard.
Please, anybody...
Started by Kevin Yu on
, 5 posts
by 5 people.
Answer Snippets (Read the full thread at stackoverflow):
Ed believes his grammar is fully compliant with the ISO/ANSI C++ standard , however he doesn't warrant it: "the....
From the C++ FAQ Lite :
38.11 Is there a yacc-able C++ grammar?
The primary yacc grammar you'll want is from Ed Willink.
|
|
Hey,
I've been looking at Haskell and I'd quite like to write a compiler (as a learning exercise) in it, since a lot of it's innate features can be readily applied to a compiler (particularly a recursive decent compiler).
What I can't quite get my head...
Started by Peter on
, 7 posts
by 7 people.
Answer Snippets (Read the full thread at stackoverflow):
A quick Google search turned up ....
:)
Programming language grammars are commonly represented in BNF form , which can be used by tools like Yacc Haskell code from a BNF grammar; I found this tool which claims to be able to do that.
|
|
What is the principal purpose of a language? Is it only for grammar or for understanding?
Started by debabratadey5 on
, 15 posts
by 8 people.
Answer Snippets (Read the full thread at indiamike):
Equally obviously, the better, sanskrit, bengali, chinese or #*....
Patently, the purpose of language is to communicate.
Grammar and the rules of structure and usage of the question.
The language skills, the better the communication.
|
|
It is well known that different people have different aptitudes regarding various programming paradigms (e.g. some people have trouble learning non-procedural, especially functional languages. Some people have trouble understanding pointers - see Joel...
Started by DVK on
, 5 posts
by 5 people.
Answer Snippets (Read the full thread at stackoverflow):
Important: the only for any particular task, but I think this has less to do with the structure or grammar of a person's language than it ....
The grammar of someone's native language affected their speed of learning math.
|
|
Over the years, "regex" pattern matching has been getting more and more powerful to the point where I wonder: is it really just context-sensitive-grammar matching? Is it a variation/extension of context-free-grammar matching? Where is it right now and...
Started by notnot on
, 4 posts
by 4 people.
Answer Snippets (Read the full thread at stackoverflow):
The current "location" in the grammar is represented by a stack a context-sensitive grammar....
The current "location" in the grammar to be matched: Recursion cannot be implemented Context-free languages: Matched by a stack machine.
|
|
Here's the grammar, which is supposed to describe a language of nested braces with commas as delimiters:
L ::= {L} | L,L |
A few more examples of strings I'd expect the grammar to accept and reject:
Accept:
{,{,,{,}},,{,}} {{{{}}}} {,{}}
Reject:
{}{} ...
Started by wkf on
, 3 posts
by 3 people.
Answer Snippets (Read the full thread at stackoverflow):
::= { L } L 1 | L 1
L 1 ::= ε | , L L 1
First of all, that grammar won't accept your first example.
|
