-
…To generate the Go code for the new 39 math functions that were introduced in GeneXproTools with …
Mini-Release 1, I decided to use the VB.Net code instead of the C++ code like Glenn did for the …
in GeneXproTools"). And the main reason for this choice is that I can use "Then", "End If", "Else" …
and "ElseIf" to put the curly braces of the Go language neatly in place. There are …
also other reasons for choosing the VB.Net Grammar as template instead of …
-
…As part of the new project "New Project: Cross-Validation, Var Importance & More", we …
support for the Go programming language in Logic Synthesis. And as usual, this includes support …
Lewis, who also shared with the GeneXproTools community 5 of the Go Boolean Grammars. We've now …
and also added the missing Reed-Muller Grammar. Creating the grammar for the Reed-Muller System …
(NOT-AND-XOR system) can be a little bit tricky for programming languages such as Go that don't …
-
…Grammar and the Reed Muller System Grammar. The changes are very simple for both Boolean Grammars. …
For the All Gates Grammar I just had to replace the gepXor function "gepXor(x0,x1)" with the …
System Grammar, I first had to revert to the C++ template and then replace all the function …
definitions with the C++ encoding. Then I just replaced the C++ XOR operator …
"^" with "!=". As an example, here's the Go code for a minimal logic circuit for the 5-Majority …
-
…Grammar) for any programming language is to choose as template the built-in programming …
language that is closest to the language we want to add. Perhaps the …
most important consideration in this phase is the comparison of code structures in both the template …
and the new language, especially the use of function prototypes and the placement of helper or …
auxiliary functions. Additionally, the number and type of …
-
…Gates Boolean Grammar" that we'll be using the C# Grammar as template to generate all the Boolean …
grammars for the Go language. In fact, I've already explained in the previous post how …
to make most of the changes all at once for the 6 Boolean grammars and, therefore, our …
should be almost ready. Indeed, we just need to check if all the logical operators for NOT, AND, …
the keywords "true" and "false" are the same in C# and Go as these are the only building blocks …
-
…NAND gates play an important role in electronics as we can build all kinds of electronic circuits …
with just NAND gates. And this is because the NAND gate is a Universal Logical System …
that can be used to define all kinds of logical expressions. For example, we can define the XOR …
function using NAND operators alone [ (XOR(x,y) = …
]; but there's no way to express the NAND function using only XOR. And like we just saw for the …
-
…In both electronics and logic the NOR gate has the same properties as the NAND …
post "Go Language: NAND Grammar"). Like NAND, we can use NOR to define any logical expression. As a …
simple example here's how we can define the XOR function using only NOR: …
= NOR(NOR(x,y),NOR(NOR(x,x),NOR(y,y))) And as expected, the NOR Grammar defines all the 258 built-in …
logical functions of GeneXproTools in terms of NOR gates …
-
…The building blocks of the MUX Universal System are 3-Multiplexer …
And with these two types of building blocks we can design any kind of logic circuit. As a simple …
example, here's a MUX circuit for the XOR function: XOR(x,y)= MUX((!(x)),(!(y)),y) The Go MUX …
of GeneXproTools defines not just the XOR function but all the 258 built-in logical functions in …
terms of MUX gates and NOT. This means that we can automatically convert all kinds of logic …
-
…The Reed-Muller System is yet another popular and compact Universal Logical System (see the previous …
post "Go Language: MUX System" about another compact logical system) that uses exclusively NOT, AND, …
and XOR in the design of electronic circuits. GeneXproTools implements the Reed-Muller …
Go language. The Reed-Muller Grammar allows us to convert automatically any logic circuit into …
NOT-AND-XOR gates. And this is possible because GeneXproTools maps all its 258 built-in …
-
…The support for the R language in Logic Synthesis requires adding the same set of Boolean …
Reed-Muller System Grammar). Now repeating the process for the R language (or any other language for …
language, so I won't repeat it here. Instead I recommend you take a look at the posts I wrote for …
the Go language as they cover all you need to know about generating all the …
System Go Language: Reed-Muller System But now back to the R language and our new Boolean Grammars, …
