Scripting custom drawing in Delphi application with IF/THEN/ELSE statements?
I’m building a Delphi application which displays a blueprint of a building, including doors, windows, wiring, lighting, outlets, switches, etc. I have implemented a very lightweight script of my own to call drawing commands to the canvas, which is loaded from a database. For example, one command is ELP 1110,1110,1290,1290,3,8388608 which draws an ellipse, parameters are 1110×1110 to 1290×1290 with pen width of 3 and the color 8388608 converted from an integer to a TColor.
How can I best manage making open source code releases from my company’s confidential research code?
My company (let’s call them Acme Technology) has a library of approximately one thousand source files that originally came from its Acme Labs research group, incubated in a development group for a couple years, and has more recently been provided to a handful of customers under non-disclosure. Acme is getting ready to release perhaps 75% of the code to the open source community. The other 25% would be released later, but for now, is either not ready for customer use or contains code related to future innovations they need to keep out of the hands of competitors.
How should I implement a command processing application?
I want to make a simple, proof-of-concept application (REPL) that takes a number and then processes commands on that number.
Extracting color profile information from JPEG files
I’m trying to look up info about reading JPEG’s color profile info and to my surprise there’s very little open specific how-to information on that regard, but rather lots of general explanation on what it is.
How to get lookahead symbol when constructing LR(1) NFA for parser?
I am reading an explanation (awesome “Parsing Techniques” by D.Grune and C.J.H.Jacobs; p.292 in the 2nd edition) about how to construct an LR(1) parser, and I am at the stage of building the initial NFA. What I don’t understand is how to get/compute a lookahead symbol.
How to read reduce/shift conflicts in LR(1) DFA?
I am reading an explanation (awesome “Parsing Techniques” by D.Grune and C.J.H.Jacobs; p.293 in the 2nd edition) and I moved forward from my last question: How to get lookahead symbol when constructing LR(1) NFA for parser?
How lookaheads are propagated in “channel” method of building LALR parser?
The method is described in Dragon Book, however I read about it in “”Parsing Techniques” by D.Grune and C.J.H.Jacobs”.
How to add precedence to LALR parser like in YACC?
Please note, I am asking about writing LALR parser, not writing rules for LALR parser.
Extracting useful information from free text
We filter and analyse seats for events. Apparently writing a domain query language for the floor people isn’t an option. I’m using C# 4.0 & .NET 4.0, and have relatively free reign to use whatever open-source tools are available. </background-info>
What is a real-world use case of using a Chomsky Type-I (context-sensitive) grammar
I have been having some fun lately exploring the development of language parsers in the context of how they fit into the Chomsky Hierarchy.