585 reputation
23
bio website
location
age
visits member for 2 years, 2 months
seen Oct 26 '13 at 2:12

I'm the author of a natural language programming tool called EngScript, which automatically translates English sentences into Python source code.

For reference, I've posted a link to questions with tags that I'm interested in.

Right now, I'm searching for a parser that can handle ambiguous grammars.

In theory, it would be possible to represent JavaScript code using Polish notation:

def sum , foo , bar baz {
    ; var theSum + foo + bar baz
    ; = return theSum
}

for var i 0 < i 10 ++ i {
    ; print sum 5 5
}

foreach current [ , 1 , 2 3 ] {
    ; print current
}

In theory, it would also be possible to create a very concise programming language with implicitly defined parameters:

isDivisibleBy: (foo % bar) == 0
//This is a function with 2 parameters: foo and bar.

isEven: isDivisibleBy(foo, 2)

isOdd: !isEven(param1)

firstCharacter: theString[0]

lastCharacter: theString[theString.length - 1]

firstNCharacters: theString[0:end]

firstCharacterIsLastCharacter: firstCharacter(stringParameter) == lastCharacter(stringParameter)

printEach: for current in anArray{ print current }

http://rosettacode.org/ is one of the most comprehensive programming language references I've ever found.

Optionally-typed programming languages are really awesome: they combine the type safety of languages like Java with the conciseness of languages like Python.

Some cool things that I've made:

Someday, I hope it will be possible to create a programming language that mixes code from different languages into a single file, like this:

Python {
    def foo():
        return "foo"
}
Ruby {
    def bar
        return foo + " was called from Python."
    end
}

This user has not asked any questions
Stack Overflow 4,125 rep 73294
Meta Stack Exchange 1,215 rep 623
Super User 1,172 rep 41234
Arqade 946 rep 5926
Web Applications 799 rep 523

6 Votes Cast

all time   by type  
6 up 3 question
0 down 3 answer