Search Results

Search found 458 results on 19 pages for 'grammar'.

Page 5/19 | < Previous Page | 1 2 3 4 5 6 7 8 9 10 11 12  | Next Page >

• Are there programs that iteratively write new programs?

  - by chris

  For about a year I have been thinking about writing a program that writes programs. This would primarily be a playful exercise that might teach me some new concepts. My inspiration came from negentropy and the ability for order to emerge from chaos and new chaos to arise out of order in infinite succession. To be more specific, the program…

  Read the article

• What trick does Java use to avoid spaces in >> ?

  - by kunjaan

  In the Java Generic Book, while contrasting the difference between C++ Templates and Java Generic says: In C++, a problem arises because without the space denotes the right-shift operator. Java fixes the problem by a trick in the grammar.) What is this trick?

  Read the article

• How to write a bison grammer for WDI?

  - by Rizo

  I need some help in bison grammar construction. From my another question: I'm trying to make a meta-language for writing markup code (such as xml and html) wich can be directly embedded into C/C++ code. Here is a simple sample written in this language, I call it WDI (Web Development Interface): /* * Simple wdi/html sample source code */ …

  Read the article

• Is it easier to write a recursive-descent parser using an EBNF or a BNF?

  - by Vivin Paliath

  I've got a BNF and EBNF for a grammar. The BNF is obviously more verbose. I have a fairly good idea as far as using the BNF to build a recursive-descent parser; there are many resources for this. I am having trouble finding resources to convert an EBNF to a recursive-descent parser. Is this because it's more difficult? I recall from my CS…

  Read the article

• Bison: Optional tokens in a single rule.

  - by Simone Margaritelli

  Hi there .. i'm using GNU Bison 2.4.2 to write a grammar for a new language i'm working on and i have a question. When i specify a rule, let's say : statement : T_CLASS T_IDENT '{' T_CLASS_MEMBERS '}' { // create a node for the statement ... } If i have a variation on the rule, for instance statement : T_CLASS T_IDENT…

  Read the article

• "Arbitrary" context free grammars?

  - by danwroy

  Long time admirer first time inquirer :) I'm working on a program which derives a deterministic finite-state automata from a context-free grammar, and the paper I have been assigned which explains how to do this keeps referring to "arbitrary probabilistic context-free grammars" but never defines the meaning of "arbitrary" in…

  Read the article

• Best solution for language documentation.

  - by Simone Margaritelli

  I'm developing a new object oriented scripting language and the project itself is quite ready for audience now, so i'm starting to think about a serious (not as "drafty" as it is right now) way of document its grammar, functions from standard library and standard library classes. I've looked a bit around and almost every…

  Read the article

• Java: how to tell if a line in a text file was supposed to be blank?

  - by defn

  I'm working on a project in which I have to read in a Grammar file (breaking it up into my data structure), with the goal of being able to generate a random "DearJohnLetter". My problem is that when reading in the .txt file, I don't know how find out whether the file was supposed to be a completely blank line or not,…

  Read the article

• Recognizing terminals in a CFG production previously not defined as tokens.

  - by kmels

  I'm making a generator of LL(1) parsers, my input is a CoCo/R language specification. I've already got a Scanner generator for that input. Suppose I've got the following specification: COMPILER 1. CHARACTERS digit="0123456789". TOKENS number = digit{digit}. decnumber = digit{digit}"."digit{digit}. PRODUCTIONS …

  Read the article

• How to transform a production to LL(1) for a list separated by a semicolon?

  - by Subb

  Hi, I'm reading this introductory book on parsing (which is pretty good btw) and one of the exercice is to "build a parser for your favorite language." Since I don't want to die today, I thought I could do a parser for something relatively simple, ie a simplified CSS. Note: This book teach you how to right a LL(1)…

  Read the article

• Is there anything in .NET that allows me to define a grammar and generate a programming language?

  - by user1525474

  I have a course in which the proffesor has asked us to create a DSL for a our final project. He presented us in the first courses xText with Eclipse. This being a new course, I am still a bit fuzzy on what Domain Specific Languages means. This is my current understanding: a domain specific language is a…

  Read the article

• Lexer antlr3 token problem

  - by nioo

  Can I construct a token ENDPLUS: '+' (options (greedy = false;):.) * '+' ; being considered by the lexer only if it is preceded by a token PREwithout including in ENDPLUS? PRE: '<<' ; Thanks.

  Read the article

• BNF vs EBNF vs ABNF: which to choose?

  - by Jason Baker

  I want to come up with a language syntax. I have read a bit about these three, and can't really see anything that one can do that another can't. Is there any reason to use one over another? Or is it just a matter of preference?

  Read the article

• GNU Flex, multiline rule

  - by Simone Margaritelli

  Hi there i have a flex rule inside my lexer definition : operators "[]"|"[]="|"[]<"|".."|"."|".="|"+"|"+="|"-"|"-="|"/"|"/="|"*"|"*="|"%"|"%="|"++"|"--"|"^"|"^="|"~"|"&"|"&="|"|"|"|="|"<<"|"<<="|">>"|"!"|"<"|">"|">="|"<="|"=="|"!="|"&&"|"||"|"~=" Is there…

  Read the article

• What makes Ometa special?

  - by Brian

  Ometa is "a new object-oriented language for pattern matching." I've encountered pattern matching in languages like Oz tools to parse grammars like Lexx/Yacc or Pyparsing before. Despite looking at example code, reading discussions, and talking to a friend, I still am not able to get a real understanding…

  Read the article

• Parse tree and grammars information

  - by fuzzylogikk

  Do anyone know where to find good online resources with examples how to make grammars and parsetrees? Preferebly introductary materials. Info that is n00b friendly, haven't found anything good with google myself. edit: I'm thinking about theory, not a specific parser software.

  Read the article

• Dependency parsing

  - by C.

  Hi I particularly like the transduce feature offered by agfl in their EP4IR http://www.agfl.cs.ru.nl/EP4IR/english.html The download page is here: http://www.agfl.cs.ru.nl/download.html Is there any way i can make use of this in a c# program? Do I need to convert classes to c#? Thanks :)

  Read the article

• How do you classify languages into regular, context free, and phrase-structure?

  - by confused

  If you're given a language, how do you figure out if it's regular, CF but not regular, or phrase-structure but not CF? Is there a good way to attack this problem? I could randomly try to make FAs or PDAs, but I feel like there's a better way to do it. Classic example: L = { a^n b^n c^n | n = 0 } Where…

  Read the article

• Theory of computation - Using the pumping lemma for context free languages

  - by Tony

  I'm reviewing my notes for my course on theory of computation and I'm having trouble understanding how to complete a certain proof. Here is the question: A = {0^n 1^m 0^n | n>=1, m>=1} Prove that A is not regular. It's pretty obvious that the pumping lemma has to be used for this. So, we have…

  Read the article

• Does Ruby have an addon similar to Perl 6 grammars?

  - by dreftymac

  Perl has been one of my go-to programming language tools for years and years. Perl 6 grammars looks like a great language feature. I'd like to know if someone has started something like this for Ruby.

  Read the article

• Theory of computation - Using the pumping lemma for CFLs

  - by Tony

  I'm reviewing my notes for my course on theory of computation and I'm having trouble understanding how to complete a certain proof. Here is the question: A = {0^n 1^m 0^n | n>=1, m>=1} Prove that A is not regular. It's pretty obvious that the pumping lemma has to be used for this. So, we have…

  Read the article

• Data Quality Check - SQL Server

  - by user319384

  I am trying to find a good mechanism where I can check whether the data being entered by a group of people is grammatically correct, has correct spellings, etc, etc. I also would like to compute words per minute and accuracy. Is there any process to do this so that I do not have to re-invent the wheel? …

  Read the article

• ANTLR: simple example from ANTLRWorks wizard doesn't work

  - by Alexey

  Screenshot: http://habreffect.ru/files/200/4cac2487f/antlr.png If I type "\nabc", it works. If I put ESC_SEQ on right, "abc" works, but "\nabc" doesn't.

  Read the article

• Why is this c# snippet legal?

  - by Sir Psycho

  Silly question, but why does the following line compile? int[] i = new int[] {1,}; As you can see, I haven't entered in the second element and left a comma there. Still compiles even though you would expect it not to.

  Read the article

• The Definition of Regular Languages

  - by AraK

  Good Day, I have tried, and burned my brain to understand the definition of Regular Languages in Discrete Mathematics and its Applications(Rosen) without reaching the goal of understanding why the definition is like that in this book. On page(789), I am rephrasing the definition: Type 3 grammars are…

  Read the article

< Previous Page | 1 2 3 4 5 6 7 8 9 10 11 12  | Next Page >