meta user
network profile
| bio | website | code.google.com/p/… |
|---|---|---|
| location | San Diego, CA | |
| age | 28 | |
| visits | member for | 2 years, 9 months |
| seen | Jun 7 at 23:38 | |
| stats | profile views | 271 |
I'm passionate about coding and researching the history of technology as well as exploring where technology is leading.
I used to work in flight simulation doing both hardware implementation (electrical design, wiring), web development (design, development, webmaster), as well as software development (desktop development in C#).
I'm a big fan of both using and contributing to Open source projects.
I am the creator of the pypreprocessor library that can be found on PYPI as well as Google code.
|
Jan 4 |
answered | Should a database table(s) structure match its intended data structure(s) in the logic? |
|
Jan 4 |
answered | What are the advantages of expressing information in the simplest possible format? |
|
Jan 4 |
comment |
What are the advantages of expressing information in the simplest possible format? +1 very good answer |
|
Jan 4 |
revised |
What is the difference between “recursion” and “self-reference”? deleted 1 characters in body |
|
Jan 4 |
answered | What is the difference between “recursion” and “self-reference”? |
|
Jan 4 |
revised |
Git-friendly spreadsheet format? added 233 characters in body; deleted 14 characters in body |
|
Jan 4 |
answered | Git-friendly spreadsheet format? |
|
Jan 4 |
comment |
Constructing a Finite State Automaton OK, I think I see. If the first match fails then it backtracks to where it can evaluate the second (hence non-deterministic). I guess I have been mixing up NFA/DFA all along. That means my answer should outline how to convert the current NFA to a DFA. Guess I'm still a FSM noob. BTW +1 good answer. |
|
Jan 4 |
revised |
Constructing a Finite State Automaton added 182 characters in body |
|
Jan 3 |
revised |
Many Blocking VS Single Non-Blocking Workers added 1099 characters in body |
|
Jan 3 |
answered | Many Blocking VS Single Non-Blocking Workers |
|
Jan 3 |
comment |
Should code completion be a consideration when choosing a programming language for a project? Many open source projects build on languages like python because the languages are designed from the ground up to be extensible. Ever worked on an open source lib for .NET, I have. It's a PITA because most everything depends on the core lib (mscorlib) which may change between versions. So creating a universal release involves targeting and testing against multiple versions of .NET. C# is great for monolithic one-offs, not so much for shared library development. |
|
Jan 3 |
comment |
Should code completion be a consideration when choosing a programming language for a project? +1 "IDE-type languages benefit more from autocompletion, but they also rely more on it..." Ding, ding ding! We have a winner. Couldn't have said it better myself. |
|
Jan 3 |
comment |
Should code completion be a consideration when choosing a programming language for a project? +1 Writing code in a language that is simple/concise/flexible will require a lot less boilerplate code (ie typing) anyway. In the end, programming productivity isn't measured in how fast you can type the code but how fast you can solve problems. If the language has amazing code completion but a smaller selection of useful libraries, you will spend much much more time implementing the parts missing than you'll save on typing. |
|
Jan 3 |
comment |
Should code completion be a consideration when choosing a programming language for a project? (cont) I'd even go so far as to argue that any language that continues to bloat at a constant rate over time will eventually lead to the level of complexity that it becomes unappealing. Either way, code completion is a component of the tools not the language. If the grammar can be parsed and compiled (statically or dynamically) then it's possible to create a tool that implements code completion for it. While the tools used for most dynamically typed language development are still in their infancy there's an increasing number of them that are starting to include code completion. |
|
Jan 3 |
comment |
Should code completion be a consideration when choosing a programming language for a project? I disagree, languages designed to be concise but extensible remain small enough that there are never any navigation issues. It theory it's appealing to engineer the perfect mega-library that is engineered to solve every imaginable problem but in practice even mega-monolithic platforms (ex .NET) come up short in that regard and deteriorate at the edges where less attention is given to improvement. In reality, as the size of the core library grows and more people depend on it, it becomes more difficult (and/or impossible) to improve/iterate on it over time. |
|
Jan 3 |
comment |
What is Developer Anarchy? @AakashM MDD, ingenious! I'm going to start today!!! /s |
|
Jan 3 |
answered | Constructing a Finite State Automaton |
|
Jan 3 |
comment |
Constructing a Finite State Automaton Correct me if I'm wrong but doesn't the Op need a valid NFA before he can determine a DFA? In this case, the NFA is invalid because it's impossible to determine whether the starting input is an employee_name or just a string in state 1 because [A-Z] is a subset of [A-Za-z0-9]. |
|
Jan 3 |
comment |
Constructing a Finite State Automaton +1 very interesting question |
