Expression Tree - Demo2, C#

Language: Layout:

//Rextester.Program.Main is the entry point for your code. Don't change it.
//Compiler version 4.0.30319.17929 for Microsoft (R) .NET Framework 4.5

using System;
using System.Collections.Generic;
using System.Linq;
using System.Text.RegularExpressions;
using System.Linq.Expressions;

namespace Rextester
{
    public class Program
    {
        public static void Main(string[] args)
        {
            Expression<Func<int, int, int>> lambda = (num1,num2) => num1 + num2; 
            // Decompose the expression tree.  
            ParameterExpression param1 = (ParameterExpression)lambda.Parameters[0];
            ParameterExpression param2 = (ParameterExpression)lambda.Parameters[1]; 
            BinaryExpression operation = (BinaryExpression)lambda.Body;  
            ParameterExpression left = (ParameterExpression)operation.Left;  
            ParameterExpression right = (ParameterExpression)operation.Right; 
            
            Console.WriteLine("Decomposed expression: ({0},{1}) => {2} {3} {4}",  
                  param1.Name, param2.Name, left.Name, operation.NodeType, right.Name); 
        }
    }
}

Show compiler warnings [ + ] Show input
Compilation time: 0,17 sec, absolute running time: 0,11 sec, cpu time: 0,09 sec, average memory usage: 15 Mb, average nr of threads: 3